Base | Representation |
---|---|
bin | 1100110011100110111… |
… | …1001110000111110100 |
3 | 210000220000102020010210 |
4 | 3030321233032013310 |
5 | 12101041033341040 |
6 | 245023324545420 |
7 | 21616050150243 |
oct | 3147157160764 |
9 | 700800366123 |
10 | 220012012020 |
11 | 85341055009 |
12 | 367816b2270 |
13 | 179933413c8 |
14 | a911c1295a |
15 | 5aca2b4480 |
hex | 3339bce1f4 |
220012012020 has 96 divisors (see below), whose sum is σ = 686601014400. Its totient is φ = 52312449024.
The previous prime is 220012012009. The next prime is 220012012021. The reversal of 220012012020 is 20210210022.
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 = 220012011987 and 220012012005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (220012012021) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5656885 + ... + 5695644.
It is an arithmetic number, because the mean of its divisors is an integer number (7152093900).
Almost surely, 2220012012020 is an apocalyptic number.
220012012020 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
220012012020 is an abundant number, since it is smaller than the sum of its proper divisors (466589002380).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
220012012020 is a wasteful number, since it uses less digits than its factorization.
220012012020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11352577 (or 11352575 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 12.
Adding to 220012012020 its reverse (20210210022), we get a palindrome (240222222042).
The spelling of 220012012020 in words is "two hundred twenty billion, twelve million, twelve thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •