Base | Representation |
---|---|
bin | 11101010001110101001… |
… | …101010100110101011101 |
3 | 21010100100111220001211221 |
4 | 131101311031110311131 |
5 | 230431044321401023 |
6 | 4140145525013341 |
7 | 265235340233344 |
oct | 35216515246535 |
9 | 7110314801757 |
10 | 2012011122013 |
11 | 70631a909602 |
12 | 285b36554251 |
13 | 117968ac1369 |
14 | 6d54bb64b5b |
15 | 3750c6e885d |
hex | 1d475354d5d |
2012011122013 has 16 divisors (see below), whose sum is σ = 2027514496320. Its totient is φ = 1996571275776.
The previous prime is 2012011121999. The next prime is 2012011122029. The reversal of 2012011122013 is 3102211102102.
It is a cyclic number.
It is not a de Polignac number, because 2012011122013 - 29 = 2012011121501 is a prime.
It is a super-2 number, since 2×20120111220132 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2012011122613) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 241911331 + ... + 241919647.
It is an arithmetic number, because the mean of its divisors is an integer number (126719656020).
Almost surely, 22012011122013 is an apocalyptic number.
It is an amenable number.
2012011122013 is a deficient number, since it is larger than the sum of its proper divisors (15503374307).
2012011122013 is a wasteful number, since it uses less digits than its factorization.
2012011122013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11916.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 2012011122013 its reverse (3102211102102), we get a palindrome (5114222224115).
The spelling of 2012011122013 in words is "two trillion, twelve billion, eleven million, one hundred twenty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •