Base | Representation |
---|---|
bin | 111011111101110… |
… | …0110010010001101 |
3 | 12012020010212210011 |
4 | 1313323212102031 |
5 | 13110100041023 |
6 | 531354313221 |
7 | 100601445532 |
oct | 16773462215 |
9 | 5166125704 |
10 | 2012112013 |
11 | 94286a59a |
12 | 481a28811 |
13 | 260b28332 |
14 | 15132cd89 |
15 | bb9a650d |
hex | 77ee648d |
2012112013 has 16 divisors (see below), whose sum is σ = 2134014336. Its totient is φ = 1893337600.
The previous prime is 2012112007. The next prime is 2012112073. The reversal of 2012112013 is 3102112102.
It is not a de Polignac number, because 2012112013 - 221 = 2010014861 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2012111984 and 2012112002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2012112073) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 353238 + ... + 358888.
It is an arithmetic number, because the mean of its divisors is an integer number (133375896).
Almost surely, 22012112013 is an apocalyptic number.
2012112013 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
It is an amenable number.
2012112013 is a deficient number, since it is larger than the sum of its proper divisors (121902323).
2012112013 is a wasteful number, since it uses less digits than its factorization.
2012112013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5924.
The product of its (nonzero) digits is 24, while the sum is 13.
The square root of 2012112013 is about 44856.5715698380. The cubic root of 2012112013 is about 1262.4592962468.
Adding to 2012112013 its reverse (3102112102), we get a palindrome (5114224115).
The spelling of 2012112013 in words is "two billion, twelve million, one hundred twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •