Base | Representation |
---|---|
bin | 101111011111111001… |
… | …0110010101110001101 |
3 | 100202021200210001002001 |
4 | 1132333302302232031 |
5 | 3132400003323041 |
6 | 114505321032301 |
7 | 10240463534221 |
oct | 1367762625615 |
9 | 322250701061 |
10 | 102002011021 |
11 | 3a293526669 |
12 | 17928325691 |
13 | 980750c251 |
14 | 4d18cc0781 |
15 | 29bed98131 |
hex | 17bfcb2b8d |
102002011021 has 2 divisors, whose sum is σ = 102002011022. Its totient is φ = 102002011020.
The previous prime is 102002010977. The next prime is 102002011031. The reversal of 102002011021 is 120110200201.
It is an a-pointer prime, because the next prime (102002011031) can be obtained adding 102002011021 to its sum of digits (10).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 70580548900 + 31421462121 = 265670^2 + 177261^2 .
It is a cyclic number.
It is not a de Polignac number, because 102002011021 - 211 = 102002008973 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 102002010989 and 102002011007.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102002011031) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51001005510 + 51001005511.
It is an arithmetic number, because the mean of its divisors is an integer number (51001005511).
Almost surely, 2102002011021 is an apocalyptic number.
It is an amenable number.
102002011021 is a deficient number, since it is larger than the sum of its proper divisors (1).
102002011021 is an equidigital number, since it uses as much as digits as its factorization.
102002011021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 102002011021 its reverse (120110200201), we get a palindrome (222112211222).
The spelling of 102002011021 in words is "one hundred two billion, two million, eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •