Base | Representation |
---|---|
bin | 11110100101101111000… |
… | …011100110010010101101 |
3 | 21102221220010012010122202 |
4 | 132211233003212102231 |
5 | 233420101132100442 |
6 | 4245405321551245 |
7 | 304605024033461 |
oct | 36455703462255 |
9 | 7387803163582 |
10 | 2102102221997 |
11 | 7405509a2438 |
12 | 29b499945525 |
13 | 1232c575c14b |
14 | 73a56bb84a1 |
15 | 39a31a6cc32 |
hex | 1e96f0e64ad |
2102102221997 has 2 divisors, whose sum is σ = 2102102221998. Its totient is φ = 2102102221996.
The previous prime is 2102102221937. The next prime is 2102102222029. The reversal of 2102102221997 is 7991222012012.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2004076247716 + 98025974281 = 1415654^2 + 313091^2 .
It is a cyclic number.
It is not a de Polignac number, because 2102102221997 - 214 = 2102102205613 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2102102221997.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2102102221937) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1051051110998 + 1051051110999.
It is an arithmetic number, because the mean of its divisors is an integer number (1051051110999).
Almost surely, 22102102221997 is an apocalyptic number.
It is an amenable number.
2102102221997 is a deficient number, since it is larger than the sum of its proper divisors (1).
2102102221997 is an equidigital number, since it uses as much as digits as its factorization.
2102102221997 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18144, while the sum is 38.
The spelling of 2102102221997 in words is "two trillion, one hundred two billion, one hundred two million, two hundred twenty-one thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •