Base | Representation |
---|---|
bin | 10100100101011001… |
… | …101000010100001000 |
3 | 2010001100101210102120 |
4 | 110211121220110020 |
5 | 330231142442300 |
6 | 14053105131240 |
7 | 1411500360663 |
oct | 244531502410 |
9 | 63040353376 |
10 | 22102312200 |
11 | 94121a7321 |
12 | 434a029b20 |
13 | 21130c5057 |
14 | 10d95b46da |
15 | 8955dd3a0 |
hex | 525668508 |
22102312200 has 96 divisors (see below), whose sum is σ = 69455896800. Its totient is φ = 5813199360.
The previous prime is 22102312189. The next prime is 22102312217. The reversal of 22102312200 is 221320122.
It is a happy number.
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 22102312200.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 208510 + ... + 296109.
It is an arithmetic number, because the mean of its divisors is an integer number (723498925).
Almost surely, 222102312200 is an apocalyptic number.
22102312200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
22102312200 is an abundant number, since it is smaller than the sum of its proper divisors (47353584600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22102312200 is a wasteful number, since it uses less digits than its factorization.
22102312200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 504711 (or 504702 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 15.
Adding to 22102312200 its reverse (221320122), we get a palindrome (22323632322).
The spelling of 22102312200 in words is "twenty-two billion, one hundred two million, three hundred twelve thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •