Numbers·47
47
XLVII
101111

The number 47 — factors and divisors

Deficient

47 is a prime: only 1 and itself divide it. The prime before is 43, the next is 53.

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

Families it belongs to

Prime

Nothing divides it but 1 and itself.

Laid out as dots

It only fits in one row. Having no other rectangle is what being prime means.

Prime factors
It does not break down further
Divisors
1, 47
Sum of divisors
48
Sum without itself
1
Coprime below it
46
Digit sum
11
Digital root
2
Roman numeral
XLVII
Binary
101111
Octal
57
Hexadecimal
2F
Base 36
1B
Bits
6 bits
Collatz steps
104 steps · peaks at 9,232
Prime before
43
Prime after
53

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

Yes. Nothing divides it but 1 and itself.

Q. What are the divisors of 47?

1, 47 — 2 divisors in all, adding up to 48.

Q. How is 47 written in binary?

101111, which is 6 bits. In hexadecimal it is 2F.

Q. How many Collatz steps does 47 take?

It reaches 1 in 104, peaking at 9,232 on the way.