Base | Representation |
---|---|
bin | 11101010001110100100… |
… | …011010100101001100001 |
3 | 21010100022202011122212002 |
4 | 131101310203110221201 |
5 | 230431034012024301 |
6 | 4140144453013345 |
7 | 265235144524013 |
oct | 35216443245141 |
9 | 7110282148762 |
10 | 2012000111201 |
11 | 706314678a63 |
12 | 285b32924255 |
13 | 1179667376a2 |
14 | 6d54a4da1b3 |
15 | 3750b77116b |
hex | 1d4748d4a61 |
2012000111201 has 2 divisors, whose sum is σ = 2012000111202. Its totient is φ = 2012000111200.
The previous prime is 2012000111161. The next prime is 2012000111203. The reversal of 2012000111201 is 1021110002102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1879026842176 + 132973269025 = 1370776^2 + 364655^2 .
It is a cyclic number.
It is not a de Polignac number, because 2012000111201 - 226 = 2011933002337 is a prime.
Together with 2012000111203, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (2012000111203) 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 as a sum of consecutive naturals, namely, 1006000055600 + 1006000055601.
It is an arithmetic number, because the mean of its divisors is an integer number (1006000055601).
Almost surely, 22012000111201 is an apocalyptic number.
It is an amenable number.
2012000111201 is a deficient number, since it is larger than the sum of its proper divisors (1).
2012000111201 is an equidigital number, since it uses as much as digits as its factorization.
2012000111201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 2012000111201 its reverse (1021110002102), we get a palindrome (3033110113303).
The spelling of 2012000111201 in words is "two trillion, twelve billion, one hundred eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •