Base | Representation |
---|---|
bin | 101111100000001110… |
… | …1100001001001010101 |
3 | 100202022110212001212021 |
4 | 1133000131201021111 |
5 | 3132410340224341 |
6 | 114510401053141 |
7 | 10240660662655 |
oct | 1370035411125 |
9 | 322273761767 |
10 | 102013211221 |
11 | 3a299886529 |
12 | 179300271b1 |
13 | 980993119c |
14 | 4d1a598365 |
15 | 29c0d5b9d1 |
hex | 17c0761255 |
102013211221 has 2 divisors, whose sum is σ = 102013211222. Its totient is φ = 102013211220.
The previous prime is 102013211197. The next prime is 102013211243. The reversal of 102013211221 is 122112310201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 99074487121 + 2938724100 = 314761^2 + 54210^2 .
It is a cyclic number.
It is not a de Polignac number, because 102013211221 - 215 = 102013178453 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 102013211195 and 102013211204.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102013212221) 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, 51006605610 + 51006605611.
It is an arithmetic number, because the mean of its divisors is an integer number (51006605611).
Almost surely, 2102013211221 is an apocalyptic number.
It is an amenable number.
102013211221 is a deficient number, since it is larger than the sum of its proper divisors (1).
102013211221 is an equidigital number, since it uses as much as digits as its factorization.
102013211221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 102013211221 its reverse (122112310201), we get a palindrome (224125521422).
The spelling of 102013211221 in words is "one hundred two billion, thirteen million, two hundred eleven thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •