Base | Representation |
---|---|
bin | 11001011101111111011001… |
… | …100011111111001010011001 |
3 | 112200121020210222211012020012 |
4 | 121131333121203333022121 |
5 | 104140201241130431014 |
6 | 1034121352133011305 |
7 | 32410415212164452 |
oct | 3135773143771231 |
9 | 480536728735205 |
10 | 112012102202009 |
11 | 3276607a5a8519 |
12 | 10690842483b35 |
13 | 4a66907c021b9 |
14 | 1d935b3c14129 |
15 | ce3a59decc3e |
hex | 65dfd98ff299 |
112012102202009 has 2 divisors, whose sum is σ = 112012102202010. Its totient is φ = 112012102202008.
The previous prime is 112012102201999. The next prime is 112012102202029. The reversal of 112012102202009 is 900202201210211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 109326263046400 + 2685839155609 = 10455920^2 + 1638853^2 .
It is an emirp because it is prime and its reverse (900202201210211) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-112012102202009 is a prime.
It is a super-2 number, since 2×1120121022020092 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (112012102202029) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56006051101004 + 56006051101005.
It is an arithmetic number, because the mean of its divisors is an integer number (56006051101005).
Almost surely, 2112012102202009 is an apocalyptic number.
It is an amenable number.
112012102202009 is a deficient number, since it is larger than the sum of its proper divisors (1).
112012102202009 is an equidigital number, since it uses as much as digits as its factorization.
112012102202009 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 288, while the sum is 23.
The spelling of 112012102202009 in words is "one hundred twelve trillion, twelve billion, one hundred two million, two hundred two thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •