Base | Representation |
---|---|
bin | 10111001111001101001010… |
… | …101101010100000100111110 |
3 | 111101212020001201211021111110 |
4 | 113033031022231110010332 |
5 | 101343421100022413042 |
6 | 1001210010522102450 |
7 | 30345464164252353 |
oct | 2717151255240476 |
9 | 441766051737443 |
10 | 102200000201022 |
11 | 2a62285a846199 |
12 | b56706534aa26 |
13 | 4504559a69b19 |
14 | 1b347137d662a |
15 | bc36cac6109c |
hex | 5cf34ab5413e |
102200000201022 has 32 divisors (see below), whose sum is σ = 204444170521344. Its totient is φ = 34059305736000.
The previous prime is 102200000201017. The next prime is 102200000201027. The reversal of 102200000201022 is 220102000002201.
It is an interprime number because it is at equal distance from previous prime (102200000201017) and next prime (102200000201027).
It is a junction number, because it is equal to n+sod(n) for n = 102200000200989 and 102200000201007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102200000201027) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 689762647 + ... + 689910797.
It is an arithmetic number, because the mean of its divisors is an integer number (6388880328792).
Almost surely, 2102200000201022 is an apocalyptic number.
102200000201022 is an abundant number, since it is smaller than the sum of its proper divisors (102244170320322).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102200000201022 is a wasteful number, since it uses less digits than its factorization.
102200000201022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 172224.
The product of its (nonzero) digits is 32, while the sum is 12.
Adding to 102200000201022 its reverse (220102000002201), we get a palindrome (322302000203223).
The spelling of 102200000201022 in words is "one hundred two trillion, two hundred billion, two hundred one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •