Base | Representation |
---|---|
bin | 11101001000100001110… |
… | …10010011110111000001 |
3 | 10112200210011222200110201 |
4 | 32210100322103313001 |
5 | 112400032320213441 |
6 | 2043505205525201 |
7 | 132214662653503 |
oct | 16442072236701 |
9 | 3480704880421 |
10 | 1001011101121 |
11 | 356587741159 |
12 | 142004713801 |
13 | 735198c1825 |
14 | 36640843d73 |
15 | 1b08a3dbc31 |
hex | e910e93dc1 |
1001011101121 has 2 divisors, whose sum is σ = 1001011101122. Its totient is φ = 1001011101120.
The previous prime is 1001011101109. The next prime is 1001011101157. The reversal of 1001011101121 is 1211011101001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 874178250625 + 126832850496 = 934975^2 + 356136^2 .
It is a cyclic number.
It is not a de Polignac number, because 1001011101121 - 227 = 1000876883393 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1001011101098 and 1001011101107.
It is not a weakly prime, because it can be changed into another prime (1001011101821) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 500505550560 + 500505550561.
It is an arithmetic number, because the mean of its divisors is an integer number (500505550561).
Almost surely, 21001011101121 is an apocalyptic number.
It is an amenable number.
1001011101121 is a deficient number, since it is larger than the sum of its proper divisors (1).
1001011101121 is an equidigital number, since it uses as much as digits as its factorization.
1001011101121 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 1001011101121 its reverse (1211011101001), we get a palindrome (2212022202122).
The spelling of 1001011101121 in words is "one trillion, one billion, eleven million, one hundred one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •