Base | Representation |
---|---|
bin | 110000000001100000101111… |
… | …000110101001011110110100 |
3 | 1000200211111012011022012122212 |
4 | 300001200233012221132310 |
5 | 210140431242104120040 |
6 | 2025112325324312552 |
7 | 62326266136304435 |
oct | 6001405706513664 |
9 | 1020744164265585 |
10 | 211210102020020 |
11 | 61330779399634 |
12 | 1b831b239a2758 |
13 | 90b104788c62c |
14 | 3a228a2b9948c |
15 | 19640d59cdd65 |
hex | c0182f1a97b4 |
211210102020020 has 48 divisors (see below), whose sum is σ = 457855925915136. Its totient is φ = 81757511568000.
The previous prime is 211210102020013. The next prime is 211210102020079. The reversal of 211210102020020 is 20020201012112.
It is a junction number, because it is equal to n+sod(n) for n = 211210102019977 and 211210102020004.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 38952350 + ... + 44042090.
It is an arithmetic number, because the mean of its divisors is an integer number (9538665123232).
Almost surely, 2211210102020020 is an apocalyptic number.
211210102020020 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
211210102020020 is an abundant number, since it is smaller than the sum of its proper divisors (246645823895116).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211210102020020 is a wasteful number, since it uses less digits than its factorization.
211210102020020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5156712 (or 5156710 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 211210102020020 its reverse (20020201012112), we get a palindrome (231230303032132).
The spelling of 211210102020020 in words is "two hundred eleven trillion, two hundred ten billion, one hundred two million, twenty thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •