Base | Representation |
---|---|
bin | 11101000110110101011… |
… | …10011010000011110001 |
3 | 10112121102211101010102201 |
4 | 32203122232122003301 |
5 | 112341202103323441 |
6 | 2043235052543201 |
7 | 132153313555363 |
oct | 16433256320361 |
9 | 3477384333381 |
10 | 1000102011121 |
11 | 356160570404 |
12 | 1419b0181b01 |
13 | 73403464855 |
14 | 36595bdcd33 |
15 | 1b0356b6c31 |
hex | e8dab9a0f1 |
1000102011121 has 2 divisors, whose sum is σ = 1000102011122. Its totient is φ = 1000102011120.
The previous prime is 1000102011091. The next prime is 1000102011127. The reversal of 1000102011121 is 1211102010001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 640928336400 + 359173674721 = 800580^2 + 599311^2 .
It is a cyclic number.
It is not a de Polignac number, because 1000102011121 - 217 = 1000101880049 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1000102011098 and 1000102011107.
It is not a weakly prime, because it can be changed into another prime (1000102011127) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 500051005560 + 500051005561.
It is an arithmetic number, because the mean of its divisors is an integer number (500051005561).
Almost surely, 21000102011121 is an apocalyptic number.
It is an amenable number.
1000102011121 is a deficient number, since it is larger than the sum of its proper divisors (1).
1000102011121 is an equidigital number, since it uses as much as digits as its factorization.
1000102011121 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 1000102011121 its reverse (1211102010001), we get a palindrome (2211204021122).
The spelling of 1000102011121 in words is "one trillion, one hundred two million, eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •