62
LXII
111110
The number 62 — factors and divisors
Deficient
62 = 2 × 31. It has 4 divisors, adding up to 96.
Its divisors, itself excluded, add up to less than the number.
Laid out as dots
It fits as 2 × 31. The more divisors, the closer to a square.
- Prime factors
- 2 × 31
- Divisors
- 1, 2, 31, 62
- Sum of divisors
- 96
- Sum without itself
- 34
- Coprime below it
- 30
- Digit sum
- 8
- Digital root
- 8
- Roman numeral
- LXII
- Binary
- 111110
- Octal
- 76
- Hexadecimal
- 3E
- Base 36
- 1Q
- Bits
- 6 bits
- Collatz steps
- 107 steps · peaks at 9,232
- Prime before
- 61
- Prime after
- 67
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.
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200
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 62 a prime number?
No. It breaks down into 2 × 31.
Q. What are the divisors of 62?
1, 2, 31, 62 — 4 divisors in all, adding up to 96.
Q. How is 62 written in binary?
111110, which is 6 bits. In hexadecimal it is 3E.
Q. How many Collatz steps does 62 take?
It reaches 1 in 107, peaking at 9,232 on the way.