Numbers·150
150
CL
10010110

The number 150 — factors and divisors

Abundant

150 = 2 × 3 × 5². It has 12 divisors, adding up to 372.

Its divisors, itself excluded, add up to more than the number.

Laid out as dots

It fits as 10 × 15. The more divisors, the closer to a square.

Prime factors
2 × 3 × 5²
Divisors
1, 2, 3, 5, 6, 10, 15, 25, 30, 50, 75, 150
Sum of divisors
372
Sum without itself
222
Coprime below it
40
Digit sum
6
Digital root
6
Roman numeral
CL
Binary
10010110
Octal
226
Hexadecimal
96
Base 36
46
Bits
8 bits
Collatz steps
15 steps · peaks at 340
Prime before
149
Prime after
151

The grid

Ten per row, twenty rows. The filled cells are primes — you can see the multiples of 2 and 5 drop out in columns.

Numbers either side

How to read this

  • The prime factors are what the number is made of. The count and sum of divisors both follow from them.
  • Add the divisors, take the number away, and you get perfect, abundant or deficient.
  • The length of the binary form is the bit count. 255 taking eight digits is what a byte is.
  • Collatz: halve it if even, triple it and add one if odd. The count is how many moves reach 1.

Frequently asked questions

Q. Is 150 a prime number?

No. It breaks down into 2 × 3 × 5².

Q. What are the divisors of 150?

1, 2, 3, 5, 6, 10, 15, 25, 30, 50, 75, 150 — 12 divisors in all, adding up to 372.

Q. How is 150 written in binary?

10010110, which is 8 bits. In hexadecimal it is 96.

Q. How many Collatz steps does 150 take?

It reaches 1 in 15, peaking at 340 on the way.