Base | Representation |
---|---|
bin | 11101000110110110100… |
… | …01000111011111101001 |
3 | 10112121110110111101220201 |
4 | 32203123101013133221 |
5 | 112341211421010441 |
6 | 2043240015552201 |
7 | 132153454113154 |
oct | 16433321073751 |
9 | 3477413441821 |
10 | 1000111110121 |
11 | 356165715642 |
12 | 1419b322b661 |
13 | 734052cc286 |
14 | 365970cac9b |
15 | 1b0363b2c31 |
hex | e8db4477e9 |
1000111110121 has 2 divisors, whose sum is σ = 1000111110122. Its totient is φ = 1000111110120.
The previous prime is 1000111110107. The next prime is 1000111110139. The reversal of 1000111110121 is 1210111110001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 525306048400 + 474805061721 = 724780^2 + 689061^2 .
It is a cyclic number.
It is not a de Polignac number, because 1000111110121 - 215 = 1000111077353 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1000111110098 and 1000111110107.
It is not a weakly prime, because it can be changed into another prime (1000111110821) 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, 500055555060 + 500055555061.
It is an arithmetic number, because the mean of its divisors is an integer number (500055555061).
Almost surely, 21000111110121 is an apocalyptic number.
It is an amenable number.
1000111110121 is a deficient number, since it is larger than the sum of its proper divisors (1).
1000111110121 is an equidigital number, since it uses as much as digits as its factorization.
1000111110121 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 1000111110121 its reverse (1210111110001), we get a palindrome (2210222220122).
The spelling of 1000111110121 in words is "one trillion, one hundred eleven million, one hundred ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •