Base | Representation |
---|---|
bin | 10111001111001110010010… |
… | …110100101101101001000011 |
3 | 111101212100012001110112021111 |
4 | 113033032102310231221003 |
5 | 101343431034241202131 |
6 | 1001210330542304151 |
7 | 30345536155240441 |
oct | 2717162264555103 |
9 | 441770161415244 |
10 | 102201210100291 |
11 | 2a6233207a3445 |
12 | b567342588057 |
13 | 45046c0619053 |
14 | 1b347ca381b91 |
15 | bc374c0a4ab1 |
hex | 5cf392d2da43 |
102201210100291 has 2 divisors, whose sum is σ = 102201210100292. Its totient is φ = 102201210100290.
The previous prime is 102201210100277. The next prime is 102201210100313. The reversal of 102201210100291 is 192001012102201.
It is an a-pointer prime, because the next prime (102201210100313) can be obtained adding 102201210100291 to its sum of digits (22).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 102201210100291 - 229 = 102200673229379 is a prime.
It is a super-2 number, since 2×1022012101002912 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (102201210100261) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51100605050145 + 51100605050146.
It is an arithmetic number, because the mean of its divisors is an integer number (51100605050146).
Almost surely, 2102201210100291 is an apocalyptic number.
102201210100291 is a deficient number, since it is larger than the sum of its proper divisors (1).
102201210100291 is an equidigital number, since it uses as much as digits as its factorization.
102201210100291 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 22.
Adding to 102201210100291 its reverse (192001012102201), we get a palindrome (294202222202492).
The spelling of 102201210100291 in words is "one hundred two trillion, two hundred one billion, two hundred ten million, one hundred thousand, two hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •