Base | Representation |
---|---|
bin | 11101001000101101101… |
… | …11011011101101001001 |
3 | 10112201001010222120212001 |
4 | 32210112313123231021 |
5 | 112400233404310441 |
6 | 2043523135151001 |
7 | 132220315116415 |
oct | 16442667335511 |
9 | 3481033876761 |
10 | 1001111010121 |
11 | 356629080282 |
12 | 142032075461 |
13 | 73534502a91 |
14 | 3664dc0dd45 |
15 | 1b094074731 |
hex | e916ddbb49 |
1001111010121 has 2 divisors, whose sum is σ = 1001111010122. Its totient is φ = 1001111010120.
The previous prime is 1001111010113. The next prime is 1001111010149. The reversal of 1001111010121 is 1210101111001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 745095249721 + 256015760400 = 863189^2 + 505980^2 .
It is a cyclic number.
It is not a de Polignac number, because 1001111010121 - 23 = 1001111010113 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1001111010098 and 1001111010107.
It is not a weakly prime, because it can be changed into another prime (1001111010101) 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, 500555505060 + 500555505061.
It is an arithmetic number, because the mean of its divisors is an integer number (500555505061).
Almost surely, 21001111010121 is an apocalyptic number.
It is an amenable number.
1001111010121 is a deficient number, since it is larger than the sum of its proper divisors (1).
1001111010121 is an equidigital number, since it uses as much as digits as its factorization.
1001111010121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2, while the sum is 10.
Adding to 1001111010121 its reverse (1210101111001), we get a palindrome (2211212121122).
The spelling of 1001111010121 in words is "one trillion, one billion, one hundred eleven million, ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •