Base | Representation |
---|---|
bin | 101111110111001… |
… | …1110101110101100 |
3 | 11010221000021021200 |
4 | 1133232132232230 |
5 | 11242120120022 |
6 | 423210325500 |
7 | 54540642042 |
oct | 13756365654 |
9 | 4127007250 |
10 | 1606020012 |
11 | 754613673 |
12 | 389a29890 |
13 | 1c7962bcc |
14 | 113420392 |
15 | 95edcbac |
hex | 5fb9ebac |
1606020012 has 36 divisors (see below), whose sum is σ = 4067501256. Its totient is φ = 534306240.
The previous prime is 1606020001. The next prime is 1606020109. The reversal of 1606020012 is 2100206061.
It is a happy number.
1606020012 is a `hidden beast` number, since 1 + 60 + 602 + 0 + 0 + 1 + 2 = 666.
It is a tau number, because it is divible by the number of its divisors (36).
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 24058 + ... + 61569.
It is an arithmetic number, because the mean of its divisors is an integer number (112986146).
Almost surely, 21606020012 is an apocalyptic number.
1606020012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1606020012 is an abundant number, since it is smaller than the sum of its proper divisors (2461481244).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1606020012 is a wasteful number, since it uses less digits than its factorization.
1606020012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 86158 (or 86153 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
The square root of 1606020012 is about 40075.1795005337. The cubic root of 1606020012 is about 1171.0721445550.
Adding to 1606020012 its reverse (2100206061), we get a palindrome (3706226073).
The spelling of 1606020012 in words is "one billion, six hundred six million, twenty thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •