Base | Representation |
---|---|
bin | 10010110101010100… |
… | …11110110001011001 |
3 | 222002122200001002201 |
4 | 21122222132301121 |
5 | 131201410120441 |
6 | 4351150130201 |
7 | 505363152526 |
oct | 113252366131 |
9 | 28078601081 |
10 | 10111020121 |
11 | 4319453084 |
12 | 1b621b0961 |
13 | c519bbc57 |
14 | 6bcbc214d |
15 | 3e29dcc31 |
hex | 25aa9ec59 |
10111020121 has 2 divisors, whose sum is σ = 10111020122. Its totient is φ = 10111020120.
The previous prime is 10111020097. The next prime is 10111020131. The reversal of 10111020121 is 12102011101.
It is an a-pointer prime, because the next prime (10111020131) can be obtained adding 10111020121 to its sum of digits (10).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7693921225 + 2417098896 = 87715^2 + 49164^2 .
It is an emirp because it is prime and its reverse (12102011101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10111020121 - 29 = 10111019609 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10111020098 and 10111020107.
It is not a weakly prime, because it can be changed into another prime (10111020131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5055510060 + 5055510061.
It is an arithmetic number, because the mean of its divisors is an integer number (5055510061).
Almost surely, 210111020121 is an apocalyptic number.
It is an amenable number.
10111020121 is a deficient number, since it is larger than the sum of its proper divisors (1).
10111020121 is an equidigital number, since it uses as much as digits as its factorization.
10111020121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 10111020121 its reverse (12102011101), we get a palindrome (22213031222).
The spelling of 10111020121 in words is "ten billion, one hundred eleven million, twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •