Base | Representation |
---|---|
bin | 1001001001010101111011… |
… | …01110101000111111011100 |
3 | 2122012201011012012011211012 |
4 | 10210222331232220333130 |
5 | 10114004311310001340 |
6 | 110435232030114352 |
7 | 4144026363211115 |
oct | 444527556507734 |
9 | 78181135164735 |
10 | 20112220000220 |
11 | 64545a9958177 |
12 | 2309a7194b9b8 |
13 | b2b7606c582a |
14 | 4d761820720c |
15 | 24d271ceb565 |
hex | 124abdba8fdc |
20112220000220 has 12 divisors (see below), whose sum is σ = 42235662000504. Its totient is φ = 8044888000080.
The previous prime is 20112220000217. The next prime is 20112220000247. The reversal of 20112220000220 is 2200002221102.
It is a junction number, because it is equal to n+sod(n) for n = 20112220000195 and 20112220000204.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 502805499986 + ... + 502805500025.
It is an arithmetic number, because the mean of its divisors is an integer number (3519638500042).
Almost surely, 220112220000220 is an apocalyptic number.
20112220000220 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20112220000220 is an abundant number, since it is smaller than the sum of its proper divisors (22123442000284).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20112220000220 is a wasteful number, since it uses less digits than its factorization.
20112220000220 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1005611000020 (or 1005611000018 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 14.
Adding to 20112220000220 its reverse (2200002221102), we get a palindrome (22312222221322).
The spelling of 20112220000220 in words is "twenty trillion, one hundred twelve billion, two hundred twenty million, two hundred twenty", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •