Base | Representation |
---|---|
bin | 10100100000101000… |
… | …000110101000001100 |
3 | 2002211202200200222220 |
4 | 110200220012220030 |
5 | 330100142022200 |
6 | 14041124335340 |
7 | 1406505532623 |
oct | 244050065014 |
9 | 62752620886 |
10 | 22022220300 |
11 | 9380a73073 |
12 | 4327244550 |
13 | 20cc631bb2 |
14 | 10ccac66ba |
15 | 88d56c4a0 |
hex | 520a06a0c |
22022220300 has 72 divisors (see below), whose sum is σ = 63737701776. Its totient is φ = 5870741760.
The previous prime is 22022220299. The next prime is 22022220347. The reversal of 22022220300 is 302222022.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 22022220300.
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 23 ways as a sum of consecutive naturals, for example, 1129434 + ... + 1148766.
It is an arithmetic number, because the mean of its divisors is an integer number (885245858).
Almost surely, 222022220300 is an apocalyptic number.
22022220300 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
22022220300 is an abundant number, since it is smaller than the sum of its proper divisors (41715481476).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22022220300 is a wasteful number, since it uses less digits than its factorization.
22022220300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23147 (or 23140 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 15.
Adding to 22022220300 its reverse (302222022), we get a palindrome (22324442322).
The spelling of 22022220300 in words is "twenty-two billion, twenty-two million, two hundred twenty thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •