Base | Representation |
---|---|
bin | 10110100010011100… |
… | …10010110111001001 |
3 | 1011020021111210011221 |
4 | 23101032102313021 |
5 | 144240112320014 |
6 | 5320403322041 |
7 | 605565215545 |
oct | 132116226711 |
9 | 34207453157 |
10 | 12100120009 |
11 | 514a22528a |
12 | 2418380321 |
13 | 11aab1ab33 |
14 | 82b040a25 |
15 | 4ac44ab24 |
hex | 2d1392dc9 |
12100120009 has 2 divisors, whose sum is σ = 12100120010. Its totient is φ = 12100120008.
The previous prime is 12100120001. The next prime is 12100120031. The reversal of 12100120009 is 90002100121.
12100120009 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11020800400 + 1079319609 = 104980^2 + 32853^2 .
It is an emirp because it is prime and its reverse (90002100121) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 12100120009 - 23 = 12100120001 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12100119974 and 12100120001.
It is not a weakly prime, because it can be changed into another prime (12100120001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6050060004 + 6050060005.
It is an arithmetic number, because the mean of its divisors is an integer number (6050060005).
Almost surely, 212100120009 is an apocalyptic number.
It is an amenable number.
12100120009 is a deficient number, since it is larger than the sum of its proper divisors (1).
12100120009 is an equidigital number, since it uses as much as digits as its factorization.
12100120009 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 16.
The spelling of 12100120009 in words is "twelve billion, one hundred million, one hundred twenty thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •