Numbers·168
168
CLXVIII
10101000

The number 168 — factors and divisors

Abundant

168 = 2³ × 3 × 7. It has 16 divisors, adding up to 480.

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

Laid out as dots

It fits as 12 × 14. The more divisors, the closer to a square.

Prime factors
2³ × 3 × 7
Divisors
1, 2, 3, 4, 6, 7, 8, 12, 14, 21, 24, 28, 42, 56, 84, 168
Sum of divisors
480
Sum without itself
312
Coprime below it
48
Digit sum
15
Digital root
6
Roman numeral
CLXVIII
Binary
10101000
Octal
250
Hexadecimal
A8
Base 36
4O
Bits
8 bits
Collatz steps
10 steps · peaks at 168
Prime before
167
Prime after
173

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 168 a prime number?

No. It breaks down into 2³ × 3 × 7.

Q. What are the divisors of 168?

1, 2, 3, 4, 6, 7, 8, 12, 14, 21, 24, 28, 42, 56, 84, 168 — 16 divisors in all, adding up to 480.

Q. How is 168 written in binary?

10101000, which is 8 bits. In hexadecimal it is A8.

Q. How many Collatz steps does 168 take?

It reaches 1 in 10, peaking at 168 on the way.