Base | Representation |
---|---|
bin | 1100001110110000110… |
… | …0011001001100100101 |
3 | 202002100200220221111101 |
4 | 3003230030121030211 |
5 | 11420312000231432 |
6 | 240310040240101 |
7 | 21115665620233 |
oct | 3035414311445 |
9 | 662320827441 |
10 | 210121102117 |
11 | 81125980003 |
12 | 34881170031 |
13 | 16a7812b0b4 |
14 | a254369953 |
15 | 56ebca44e7 |
hex | 30ec319325 |
210121102117 has 2 divisors, whose sum is σ = 210121102118. Its totient is φ = 210121102116.
The previous prime is 210121102073. The next prime is 210121102129. The reversal of 210121102117 is 711201121012.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 209836370241 + 284731876 = 458079^2 + 16874^2 .
It is a cyclic number.
It is not a de Polignac number, because 210121102117 - 227 = 209986884389 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 210121102094 and 210121102103.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (210121102157) 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, 105060551058 + 105060551059.
It is an arithmetic number, because the mean of its divisors is an integer number (105060551059).
Almost surely, 2210121102117 is an apocalyptic number.
It is an amenable number.
210121102117 is a deficient number, since it is larger than the sum of its proper divisors (1).
210121102117 is an equidigital number, since it uses as much as digits as its factorization.
210121102117 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 56, while the sum is 19.
Adding to 210121102117 its reverse (711201121012), we get a palindrome (921322223129).
The spelling of 210121102117 in words is "two hundred ten billion, one hundred twenty-one million, one hundred two thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •