Base | Representation |
---|---|
bin | 1011000001000000101110… |
… | …0101101111111111101010 |
3 | 1120212220012021000101200012 |
4 | 2300100023211233333222 |
5 | 3041420340032020020 |
6 | 41432102122211522 |
7 | 2360030464122050 |
oct | 260201345577752 |
9 | 46786167011605 |
10 | 12112002220010 |
11 | 394a7425484a0 |
12 | 1437479053ba2 |
13 | 69b206960454 |
14 | 2dc31ca781d0 |
15 | 1600dabb87c5 |
hex | b040b96ffea |
12112002220010 has 128 divisors (see below), whose sum is σ = 27440827176960. Its totient is φ = 3739127443200.
The previous prime is 12112002219983. The next prime is 12112002220037. The reversal of 12112002220010 is 1002220021121.
It is an interprime number because it is at equal distance from previous prime (12112002219983) and next prime (12112002220037).
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 511712456 + ... + 511736124.
It is an arithmetic number, because the mean of its divisors is an integer number (214381462320).
Almost surely, 212112002220010 is an apocalyptic number.
12112002220010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12112002220010 is an abundant number, since it is smaller than the sum of its proper divisors (15328824956950).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12112002220010 is a wasteful number, since it uses less digits than its factorization.
12112002220010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30012.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 12112002220010 its reverse (1002220021121), we get a palindrome (13114222241131).
The spelling of 12112002220010 in words is "twelve trillion, one hundred twelve billion, two million, two hundred twenty thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •