Base | Representation |
---|---|
bin | 11101010010000001001… |
… | …000101000111000110100 |
3 | 21010100212110102002201020 |
4 | 131102001020220320310 |
5 | 230432002033020040 |
6 | 4140221433501140 |
7 | 265243320106431 |
oct | 35220110507064 |
9 | 7110773362636 |
10 | 2012211220020 |
11 | 706412859161 |
12 | 285b915717b0 |
13 | 11799b3b1151 |
14 | 6d56a570b88 |
15 | 37520071cd0 |
hex | 1d481228e34 |
2012211220020 has 24 divisors (see below), whose sum is σ = 5634191416224. Its totient is φ = 536589658656.
The previous prime is 2012211220013. The next prime is 2012211220069. The reversal of 2012211220020 is 200221122102.
It is a Harshad number since it is a multiple of its sum of digits (15).
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, 16768426774 + ... + 16768426893.
It is an arithmetic number, because the mean of its divisors is an integer number (234757975676).
Almost surely, 22012211220020 is an apocalyptic number.
2012211220020 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2012211220020 is an abundant number, since it is smaller than the sum of its proper divisors (3621980196204).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2012211220020 is a wasteful number, since it uses less digits than its factorization.
2012211220020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 33536853679 (or 33536853677 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 2012211220020 its reverse (200221122102), we get a palindrome (2212432342122).
It can be divided in two parts, 201221 and 1220020, that added together give a palindrome (1421241).
The spelling of 2012211220020 in words is "two trillion, twelve billion, two hundred eleven million, two hundred twenty thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.777 sec. • engine limits •