Base | Representation |
---|---|
bin | 1001000110011011101010… |
… | …10001110000011100010000 |
3 | 2121212011001000222001200221 |
4 | 10203031311101300130100 |
5 | 10110340011334034300 |
6 | 110321253111522424 |
7 | 4133556321132634 |
oct | 443156521603420 |
9 | 77764030861627 |
10 | 20012220221200 |
11 | 64161536630a9 |
12 | 22b2604089414 |
13 | b221b4c6285c |
14 | 4d284d202dc4 |
15 | 24a86cb0731a |
hex | 123375470710 |
20012220221200 has 60 divisors (see below), whose sum is σ = 49102324214400. Its totient is φ = 7834571313280.
The previous prime is 20012220221197. The next prime is 20012220221251. The reversal of 20012220221200 is 212202221002.
It is a Harshad number since it is a multiple of its sum of digits (16).
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 11 ways as a sum of consecutive naturals, for example, 532221100 + ... + 532258699.
It is an arithmetic number, because the mean of its divisors is an integer number (818372070240).
Almost surely, 220012220221200 is an apocalyptic number.
20012220221200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20012220221200 is an abundant number, since it is smaller than the sum of its proper divisors (29090103993200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20012220221200 is a wasteful number, since it uses less digits than its factorization.
20012220221200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1064479864 (or 1064479853 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 16.
Adding to 20012220221200 its reverse (212202221002), we get a palindrome (20224422442202).
The spelling of 20012220221200 in words is "twenty trillion, twelve billion, two hundred twenty million, two hundred twenty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •