Base | Representation |
---|---|
bin | 1000010001011101… |
… | …0000111100000000 |
3 | 12201202121210122020 |
4 | 2010113100330000 |
5 | 14021444104300 |
6 | 1004205041440 |
7 | 106013364240 |
oct | 20427207400 |
9 | 5652553566 |
10 | 2220691200 |
11 | a3a582192 |
12 | 51b856280 |
13 | 2950c7580 |
14 | 170d05b20 |
15 | cee578a0 |
hex | 845d0f00 |
2220691200 has 864 divisors, whose sum is σ = 9538056192. Its totient is φ = 442368000.
The previous prime is 2220691199. The next prime is 2220691223. The reversal of 2220691200 is 21960222.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 54163180 + ... + 54163220.
Almost surely, 22220691200 is an apocalyptic number.
2220691200 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 2220691200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4769028096).
2220691200 is an abundant number, since it is smaller than the sum of its proper divisors (7317364992).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2220691200 is a wasteful number, since it uses less digits than its factorization.
2220691200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 121 (or 102 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 24.
The square root of 2220691200 is about 47124.2103382115. The cubic root of 2220691200 is about 1304.6561240713.
The spelling of 2220691200 in words is "two billion, two hundred twenty million, six hundred ninety-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •