Base | Representation |
---|---|
bin | 100000000001110111000… |
… | …101101000010011000000 |
3 | 21210102012221201212222122 |
4 | 200001313011220103000 |
5 | 242030142413020112 |
6 | 4403045111223412 |
7 | 315006233452655 |
oct | 40016705502300 |
9 | 7712187655878 |
10 | 2201021220032 |
11 | 7794a2109788 |
12 | 2b66a5677b68 |
13 | 12c72b31024b |
14 | 7875c443c2c |
15 | 3c3c0e25872 |
hex | 200771684c0 |
2201021220032 has 112 divisors (see below), whose sum is σ = 4602861365760. Its totient is φ = 1042208335872.
The previous prime is 2201021220029. The next prime is 2201021220067. The reversal of 2201021220032 is 2300221201022.
It is a super-2 number, since 2×22010212200322 (a number of 25 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 374384069 + ... + 374389947.
It is an arithmetic number, because the mean of its divisors is an integer number (41096976480).
Almost surely, 22201021220032 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2201021220032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2301430682880).
2201021220032 is an abundant number, since it is smaller than the sum of its proper divisors (2401840145728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2201021220032 is a wasteful number, since it uses less digits than its factorization.
2201021220032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8398 (or 8388 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 17.
Adding to 2201021220032 its reverse (2300221201022), we get a palindrome (4501242421054).
The spelling of 2201021220032 in words is "two trillion, two hundred one billion, twenty-one million, two hundred twenty thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •