Base | Representation |
---|---|
bin | 10111001111011000011101… |
… | …000111011111001100110101 |
3 | 111101220101100101202122100012 |
4 | 113033120131013133030311 |
5 | 101344120410233243102 |
6 | 1001215333320030005 |
7 | 30346403423535215 |
oct | 2717303507371465 |
9 | 441811311678305 |
10 | 102212120212277 |
11 | 2a627a0a217019 |
12 | b569488302305 |
13 | 450573ba3070a |
14 | 1b35143334245 |
15 | bc3b89cda752 |
hex | 5cf61d1df335 |
102212120212277 has 2 divisors, whose sum is σ = 102212120212278. Its totient is φ = 102212120212276.
The previous prime is 102212120212183. The next prime is 102212120212303. The reversal of 102212120212277 is 772212021212201.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 85396986620401 + 16815133591876 = 9241049^2 + 4100626^2 .
It is a cyclic number.
It is not a de Polignac number, because 102212120212277 - 212 = 102212120208181 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102212120212177) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51106060106138 + 51106060106139.
It is an arithmetic number, because the mean of its divisors is an integer number (51106060106139).
Almost surely, 2102212120212277 is an apocalyptic number.
It is an amenable number.
102212120212277 is a deficient number, since it is larger than the sum of its proper divisors (1).
102212120212277 is an equidigital number, since it uses as much as digits as its factorization.
102212120212277 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6272, while the sum is 32.
Adding to 102212120212277 its reverse (772212021212201), we get a palindrome (874424141424478).
The spelling of 102212120212277 in words is "one hundred two trillion, two hundred twelve billion, one hundred twenty million, two hundred twelve thousand, two hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •