Base | Representation |
---|---|
bin | 101111100110011001… |
… | …1001010010000001001 |
3 | 100202211220100202110111 |
4 | 1133030303022100021 |
5 | 3133321333224314 |
6 | 114543113514321 |
7 | 10246053313324 |
oct | 1371463122011 |
9 | 322756322414 |
10 | 102220211209 |
11 | 3a39570a6a6 |
12 | 179894129a1 |
13 | 984079969c |
14 | 4d39c7d7bb |
15 | 29d40e9ec4 |
hex | 17cccca409 |
102220211209 has 2 divisors, whose sum is σ = 102220211210. Its totient is φ = 102220211208.
The previous prime is 102220211189. The next prime is 102220211257. The reversal of 102220211209 is 902112022201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 98472322809 + 3747888400 = 313803^2 + 61220^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102220211209 is a prime.
It is a super-2 number, since 2×1022202112092 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 102220211209.
It is not a weakly prime, because it can be changed into another prime (102220241209) 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, 51110105604 + 51110105605.
It is an arithmetic number, because the mean of its divisors is an integer number (51110105605).
Almost surely, 2102220211209 is an apocalyptic number.
It is an amenable number.
102220211209 is a deficient number, since it is larger than the sum of its proper divisors (1).
102220211209 is an equidigital number, since it uses as much as digits as its factorization.
102220211209 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 22.
The spelling of 102220211209 in words is "one hundred two billion, two hundred twenty million, two hundred eleven thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •