Base | Representation |
---|---|
bin | 111011111101110… |
… | …1000100000011001 |
3 | 12012020011100021012 |
4 | 1313323220200121 |
5 | 13110100333423 |
6 | 531354423305 |
7 | 100601514212 |
oct | 16773504031 |
9 | 5166140235 |
10 | 2012121113 |
11 | 942876412 |
12 | 481a31b35 |
13 | 260b2c512 |
14 | 151332409 |
15 | bb9a9078 |
hex | 77ee8819 |
2012121113 has 2 divisors, whose sum is σ = 2012121114. Its totient is φ = 2012121112.
The previous prime is 2012121107. The next prime is 2012121127. The reversal of 2012121113 is 3111212102.
It is an a-pointer prime, because the next prime (2012121127) can be obtained adding 2012121113 to its sum of digits (14).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1766352784 + 245768329 = 42028^2 + 15677^2 .
It is a cyclic number.
It is not a de Polignac number, because 2012121113 - 28 = 2012120857 is a prime.
It is not a weakly prime, because it can be changed into another prime (2012121313) 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, 1006060556 + 1006060557.
It is an arithmetic number, because the mean of its divisors is an integer number (1006060557).
Almost surely, 22012121113 is an apocalyptic number.
It is an amenable number.
2012121113 is a deficient number, since it is larger than the sum of its proper divisors (1).
2012121113 is an equidigital number, since it uses as much as digits as its factorization.
2012121113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 14.
The square root of 2012121113 is about 44856.6730041362. The cubic root of 2012121113 is about 1262.4611994480.
Adding to 2012121113 its reverse (3111212102), we get a palindrome (5123333215).
The spelling of 2012121113 in words is "two billion, twelve million, one hundred twenty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •