Base | Representation |
---|---|
bin | 10111001111011000010110… |
… | …000000101110111000111101 |
3 | 111101220101001002110002020111 |
4 | 113033120112000232320331 |
5 | 101344120134224013041 |
6 | 1001215313420550021 |
7 | 30346400445340432 |
oct | 2717302600567075 |
9 | 441811032402214 |
10 | 102212001001021 |
11 | 2a6279589a391a |
12 | b5694543b2311 |
13 | 4505720121802 |
14 | 1b35131581b89 |
15 | bc3b7e5dd981 |
hex | 5cf61602ee3d |
102212001001021 has 2 divisors, whose sum is σ = 102212001001022. Its totient is φ = 102212001001020.
The previous prime is 102212001000979. The next prime is 102212001001027. The reversal of 102212001001021 is 120100100212201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 63929443456921 + 38282557544100 = 7995589^2 + 6187290^2 .
It is a cyclic number.
It is not a de Polignac number, because 102212001001021 - 217 = 102212000869949 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 102212001000992 and 102212001001010.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102212001001027) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51106000500510 + 51106000500511.
It is an arithmetic number, because the mean of its divisors is an integer number (51106000500511).
Almost surely, 2102212001001021 is an apocalyptic number.
It is an amenable number.
102212001001021 is a deficient number, since it is larger than the sum of its proper divisors (1).
102212001001021 is an equidigital number, since it uses as much as digits as its factorization.
102212001001021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 102212001001021 its reverse (120100100212201), we get a palindrome (222312101213222).
The spelling of 102212001001021 in words is "one hundred two trillion, two hundred twelve billion, one million, one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •