Base | Representation |
---|---|
bin | 11001001111100100100011… |
… | …001100000100011111101001 |
3 | 112120002112010022111211202101 |
4 | 121033210203030010133221 |
5 | 104022432404200013001 |
6 | 1032042233555533401 |
7 | 32246005555353643 |
oct | 3117444314043751 |
9 | 476075108454671 |
10 | 111021200001001 |
11 | 324139100a1674 |
12 | 1055079b2ba261 |
13 | 49c433c739694 |
14 | 1d5b651b9d893 |
15 | cc7db2230a01 |
hex | 64f9233047e9 |
111021200001001 has 2 divisors, whose sum is σ = 111021200001002. Its totient is φ = 111021200001000.
The previous prime is 111021200000981. The next prime is 111021200001007. The reversal of 111021200001001 is 100100002120111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 110281082190400 + 740117810601 = 10501480^2 + 860301^2 .
It is a cyclic number.
It is not a de Polignac number, because 111021200001001 - 211 = 111021199998953 is a prime.
It is not a weakly prime, because it can be changed into another prime (111021200001007) 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 as a sum of consecutive naturals, namely, 55510600000500 + 55510600000501.
It is an arithmetic number, because the mean of its divisors is an integer number (55510600000501).
Almost surely, 2111021200001001 is an apocalyptic number.
It is an amenable number.
111021200001001 is a deficient number, since it is larger than the sum of its proper divisors (1).
111021200001001 is an equidigital number, since it uses as much as digits as its factorization.
111021200001001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 111021200001001 its reverse (100100002120111), we get a palindrome (211121202121112).
The spelling of 111021200001001 in words is "one hundred eleven trillion, twenty-one billion, two hundred million, one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •