Base | Representation |
---|---|
bin | 10110101111001101001100… |
… | …101111101001010011010001 |
3 | 111010002000002101220021222202 |
4 | 112233031030233221103101 |
5 | 101101404032321023441 |
6 | 552403455202212545 |
7 | 30030556164351131 |
oct | 2657151457512321 |
9 | 433060071807882 |
10 | 100001011111121 |
11 | 299552108299aa |
12 | b270a48354155 |
13 | 43a5093773653 |
14 | 1a9a109212ac1 |
15 | b863c844819b |
hex | 5af34cbe94d1 |
100001011111121 has 2 divisors, whose sum is σ = 100001011111122. Its totient is φ = 100001011111120.
The previous prime is 100001011111039. The next prime is 100001011111129. The reversal of 100001011111121 is 121111110100001.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 75518950346896 + 24482060764225 = 8690164^2 + 4947935^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100001011111121 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (100001011111129) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50000505555560 + 50000505555561.
It is an arithmetic number, because the mean of its divisors is an integer number (50000505555561).
Almost surely, 2100001011111121 is an apocalyptic number.
It is an amenable number.
100001011111121 is a deficient number, since it is larger than the sum of its proper divisors (1).
100001011111121 is an equidigital number, since it uses as much as digits as its factorization.
100001011111121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2, while the sum is 11.
Adding to 100001011111121 its reverse (121111110100001), we get a palindrome (221112121211122).
The spelling of 100001011111121 in words is "one hundred trillion, one billion, eleven million, one hundred eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •