Base | Representation |
---|---|
bin | 10010101010101101… |
… | …11100000011110001 |
3 | 221212110011220201002 |
4 | 21111112330003301 |
5 | 131011113323441 |
6 | 4334250251345 |
7 | 503232455213 |
oct | 112526740361 |
9 | 27773156632 |
10 | 10022011121 |
11 | 4283189321 |
12 | 1b38426b55 |
13 | c394260c5 |
14 | 6b10525b3 |
15 | 3d9ca9b9b |
hex | 2555bc0f1 |
10022011121 has 2 divisors, whose sum is σ = 10022011122. Its totient is φ = 10022011120.
The previous prime is 10022011067. The next prime is 10022011123. The reversal of 10022011121 is 12111022001.
10022011121 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6234839521 + 3787171600 = 78961^2 + 61540^2 .
It is a cyclic number.
It is not a de Polignac number, because 10022011121 - 26 = 10022011057 is a prime.
Together with 10022011123, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (10022011123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5011005560 + 5011005561.
It is an arithmetic number, because the mean of its divisors is an integer number (5011005561).
Almost surely, 210022011121 is an apocalyptic number.
It is an amenable number.
10022011121 is a deficient number, since it is larger than the sum of its proper divisors (1).
10022011121 is an equidigital number, since it uses as much as digits as its factorization.
10022011121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 10022011121 its reverse (12111022001), we get a palindrome (22133033122).
The spelling of 10022011121 in words is "ten billion, twenty-two million, eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •