Base | Representation |
---|---|
bin | 11001011101110110000101… |
… | …011000101100011111011011 |
3 | 112200120021222220221202121112 |
4 | 121131312011120230133123 |
5 | 104140020300101134321 |
6 | 1034113015431330535 |
7 | 32406612310100501 |
oct | 3135660530543733 |
9 | 480507886852545 |
10 | 112002100021211 |
11 | 32761907633aa4 |
12 | 1068a910820a4b |
13 | 4a659a293021a |
14 | 1d92d05684671 |
15 | ce3671c5da5b |
hex | 65dd8562c7db |
112002100021211 has 2 divisors, whose sum is σ = 112002100021212. Its totient is φ = 112002100021210.
The previous prime is 112002100021139. The next prime is 112002100021267. The reversal of 112002100021211 is 112120001200211.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-112002100021211 is a prime.
It is a super-2 number, since 2×1120021000212112 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (112002100021291) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56001050010605 + 56001050010606.
It is an arithmetic number, because the mean of its divisors is an integer number (56001050010606).
Almost surely, 2112002100021211 is an apocalyptic number.
112002100021211 is a deficient number, since it is larger than the sum of its proper divisors (1).
112002100021211 is an equidigital number, since it uses as much as digits as its factorization.
112002100021211 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 112002100021211 its reverse (112120001200211), we get a palindrome (224122101221422).
The spelling of 112002100021211 in words is "one hundred twelve trillion, two billion, one hundred million, twenty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •