Base | Representation |
---|---|
bin | 1001000110101100001101… |
… | …00111101000010001111000 |
3 | 2121212222221221220120011110 |
4 | 10203112012213220101320 |
5 | 10111011203340232300 |
6 | 110325322240000320 |
7 | 4134322356312162 |
oct | 443260647502170 |
9 | 77788857816143 |
10 | 20021101102200 |
11 | 64199a0694480 |
12 | 22b42823000a0 |
13 | b22c9bb36c23 |
14 | 4d305288b932 |
15 | 24abdc604550 |
hex | 1235869e8478 |
20021101102200 has 192 divisors, whose sum is σ = 69537663054720. Its totient is φ = 4722421824000.
The previous prime is 20021101102181. The next prime is 20021101102207. The reversal of 20021101102200 is 220110112002.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20021101102207) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 40749046 + ... + 41237445.
It is an arithmetic number, because the mean of its divisors is an integer number (362175328410).
Almost surely, 220021101102200 is an apocalyptic number.
20021101102200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20021101102200 is an abundant number, since it is smaller than the sum of its proper divisors (49516561952520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20021101102200 is a wasteful number, since it uses less digits than its factorization.
20021101102200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 81986558 (or 81986549 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 20021101102200 its reverse (220110112002), we get a palindrome (20241211214202).
The spelling of 20021101102200 in words is "twenty trillion, twenty-one billion, one hundred one million, one hundred two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •