Base | Representation |
---|---|
bin | 10010101110001011… |
… | …110011111110000100 |
3 | 1220212221211121222010 |
4 | 102232023303332010 |
5 | 312132130414340 |
6 | 13122415534220 |
7 | 1311102614433 |
oct | 225613637604 |
9 | 56787747863 |
10 | 20102201220 |
11 | 8586194342 |
12 | 3a9022a370 |
13 | 1b8490c32a |
14 | d89acb11a |
15 | 7c9c07b80 |
hex | 4ae2f3f84 |
20102201220 has 24 divisors (see below), whose sum is σ = 56286163584. Its totient is φ = 5360586976.
The previous prime is 20102201213. The next prime is 20102201261. The reversal of 20102201220 is 2210220102.
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 = 20102201196 and 20102201205.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 167518284 + ... + 167518403.
It is an arithmetic number, because the mean of its divisors is an integer number (2345256816).
Almost surely, 220102201220 is an apocalyptic number.
20102201220 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20102201220 is an abundant number, since it is smaller than the sum of its proper divisors (36183962364).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20102201220 is a wasteful number, since it uses less digits than its factorization.
20102201220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 335036699 (or 335036697 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 12.
Adding to 20102201220 its reverse (2210220102), we get a palindrome (22312421322).
The spelling of 20102201220 in words is "twenty billion, one hundred two million, two hundred one thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •