Base | Representation |
---|---|
bin | 100000000001110111000… |
… | …001000011100111010000 |
3 | 21210102012212110222111110 |
4 | 200001313001003213100 |
5 | 242030142111134300 |
6 | 4403045025413320 |
7 | 315006220330560 |
oct | 40016701034720 |
9 | 7712185428443 |
10 | 2201020021200 |
11 | 7794a1470010 |
12 | 2b66a519a240 |
13 | 12c72acb0690 |
14 | 7875c210da0 |
15 | 3c3c0c8a550 |
hex | 200770439d0 |
2201020021200 has 960 divisors, whose sum is σ = 9722589714432. Its totient is φ = 410755276800.
The previous prime is 2201020021177. The next prime is 2201020021217. The reversal of 2201020021200 is 21200201022.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 44419639 + ... + 44469161.
Almost surely, 22201020021200 is an apocalyptic number.
2201020021200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2201020021200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4861294857216).
2201020021200 is an abundant number, since it is smaller than the sum of its proper divisors (7521569693232).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2201020021200 is a wasteful number, since it uses less digits than its factorization.
2201020021200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49612 (or 49601 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 12.
Adding to 2201020021200 its reverse (21200201022), we get a palindrome (2222220222222).
The spelling of 2201020021200 in words is "two trillion, two hundred one billion, twenty million, twenty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.112 sec. • engine limits •