Base | Representation |
---|---|
bin | 10111001111001111000011… |
… | …001101110111110101100100 |
3 | 111101212102021122012102001220 |
4 | 113033033003031313311210 |
5 | 101343434220113031040 |
6 | 1001210543304220340 |
7 | 30345565244264043 |
oct | 2717170315676544 |
9 | 441772248172056 |
10 | 102202022002020 |
11 | 2a6236a8023206 |
12 | b56752a46a6b0 |
13 | 45047bc8a8285 |
14 | 1b3486612855a |
15 | bc37984cd2d0 |
hex | 5cf3c3377d64 |
102202022002020 has 192 divisors, whose sum is σ = 315323513487360. Its totient is φ = 24634648281600.
The previous prime is 102202022001983. The next prime is 102202022002027. The reversal of 102202022002020 is 20200220202201.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is not an unprimeable number, because it can be changed into a prime (102202022002027) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 17856807 + ... + 22875086.
It is an arithmetic number, because the mean of its divisors is an integer number (1642309966080).
Almost surely, 2102202022002020 is an apocalyptic number.
102202022002020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
102202022002020 is an abundant number, since it is smaller than the sum of its proper divisors (213121491485340).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102202022002020 is a wasteful number, since it uses less digits than its factorization.
102202022002020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 40732026 (or 40732024 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 15.
Adding to 102202022002020 its reverse (20200220202201), we get a palindrome (122402242204221).
The spelling of 102202022002020 in words is "one hundred two trillion, two hundred two billion, twenty-two million, two thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •