Base | Representation |
---|---|
bin | 10010101001100001… |
… | …10000011011011100 |
3 | 221211202100101210100 |
4 | 21110300300123130 |
5 | 131001033031022 |
6 | 4333251541100 |
7 | 503051420145 |
oct | 112460603334 |
9 | 27752311710 |
10 | 10012002012 |
11 | 4278572331 |
12 | 1b34bba790 |
13 | c3733035c |
14 | 6ad9a8acc |
15 | 3d8e7e1ac |
hex | 254c306dc |
10012002012 has 36 divisors (see below), whose sum is σ = 25454421720. Its totient is φ = 3318040992.
The previous prime is 10012001971. The next prime is 10012002019. The reversal of 10012002012 is 21020021001.
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 (9).
It is a junction number, because it is equal to n+sod(n) for n = 10012001985 and 10012002003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10012002019) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 797562 + ... + 810017.
It is an arithmetic number, because the mean of its divisors is an integer number (707067270).
Almost surely, 210012002012 is an apocalyptic number.
10012002012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10012002012 is an abundant number, since it is smaller than the sum of its proper divisors (15442419708).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10012002012 is a wasteful number, since it uses less digits than its factorization.
10012002012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1607762 (or 1607757 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 10012002012 its reverse (21020021001), we get a palindrome (31032023013).
The spelling of 10012002012 in words is "ten billion, twelve million, two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •