Base | Representation |
---|---|
bin | 1001000110000101101110… |
… | …0011111011110111110100 |
3 | 1022102000022112020000120201 |
4 | 2101201123203323313310 |
5 | 2302320422310341040 |
6 | 33134012044410244 |
7 | 2051330526410620 |
oct | 221413343736764 |
9 | 38360275200521 |
10 | 10000220012020 |
11 | 3206084545337 |
12 | 1156139546984 |
13 | 57702a8cb554 |
14 | 268028440180 |
15 | 1251de401a9a |
hex | 9185b8fbdf4 |
10000220012020 has 24 divisors (see below), whose sum is σ = 24000528029184. Its totient is φ = 3428646861216.
The previous prime is 10000220011967. The next prime is 10000220012053. The reversal of 10000220012020 is 2021002200001.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a junction number, because it is equal to n+sod(n) for n = 10000220011988 and 10000220012006.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 35715071332 + ... + 35715071611.
It is an arithmetic number, because the mean of its divisors is an integer number (1000022001216).
Almost surely, 210000220012020 is an apocalyptic number.
10000220012020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10000220012020 is an abundant number, since it is smaller than the sum of its proper divisors (14000308017164).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10000220012020 is a wasteful number, since it uses less digits than its factorization.
10000220012020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 71430142959 (or 71430142957 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 10.
Adding to 10000220012020 its reverse (2021002200001), we get a palindrome (12021222212021).
The spelling of 10000220012020 in words is "ten trillion, two hundred twenty million, twelve thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •