Base | Representation |
---|---|
bin | 11110101101010001110… |
… | …110100011111111010100 |
3 | 21110201210121201122121210 |
4 | 132231101312203333110 |
5 | 234033143230400040 |
6 | 4253225152341420 |
7 | 305312530514655 |
oct | 36552166437724 |
9 | 7421717648553 |
10 | 2110202200020 |
11 | 743a28146852 |
12 | 2a0b7a544870 |
13 | 123cb6908a55 |
14 | 741c486952c |
15 | 39d57c16480 |
hex | 1eb51da3fd4 |
2110202200020 has 48 divisors (see below), whose sum is σ = 6165460344960. Its totient is φ = 538254473856.
The previous prime is 2110202200019. The next prime is 2110202200061. The reversal of 2110202200020 is 200022020112.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a junction number, because it is equal to n+sod(n) for n = 2110202199969 and 2110202200005.
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, 764564635 + ... + 764567394.
It is an arithmetic number, because the mean of its divisors is an integer number (128447090520).
Almost surely, 22110202200020 is an apocalyptic number.
2110202200020 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2110202200020 is an abundant number, since it is smaller than the sum of its proper divisors (4055258144940).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2110202200020 is a wasteful number, since it uses less digits than its factorization.
2110202200020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1529132064 (or 1529132062 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 12.
Adding to 2110202200020 its reverse (200022020112), we get a palindrome (2310224220132).
The spelling of 2110202200020 in words is "two trillion, one hundred ten billion, two hundred two million, two hundred thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.158 sec. • engine limits •