Base | Representation |
---|---|
bin | 10111001101111011011001… |
… | …011110110010000011001001 |
3 | 111101112211102212112221012112 |
4 | 113031323121132302003021 |
5 | 101341001242003022142 |
6 | 1001101410405152105 |
7 | 30336235352241542 |
oct | 2715733136620311 |
9 | 441484385487175 |
10 | 102112201220297 |
11 | 2a5995a55904a4 |
12 | b5520416bb635 |
13 | 44c91a6c45118 |
14 | 1b30384d5d4c9 |
15 | bc128cc53382 |
hex | 5cded97b20c9 |
102112201220297 has 2 divisors, whose sum is σ = 102112201220298. Its totient is φ = 102112201220296.
The previous prime is 102112201220149. The next prime is 102112201220299. The reversal of 102112201220297 is 792022102211201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 76290162611776 + 25822038608521 = 8734424^2 + 5081539^2 .
It is a cyclic number.
It is not a de Polignac number, because 102112201220297 - 236 = 102043481743561 is a prime.
Together with 102112201220299, 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 (102112201220299) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51056100610148 + 51056100610149.
It is an arithmetic number, because the mean of its divisors is an integer number (51056100610149).
Almost surely, 2102112201220297 is an apocalyptic number.
It is an amenable number.
102112201220297 is a deficient number, since it is larger than the sum of its proper divisors (1).
102112201220297 is an equidigital number, since it uses as much as digits as its factorization.
102112201220297 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4032, while the sum is 32.
Adding to 102112201220297 its reverse (792022102211201), we get a palindrome (894134303431498).
The spelling of 102112201220297 in words is "one hundred two trillion, one hundred twelve billion, two hundred one million, two hundred twenty thousand, two hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •