Base | Representation |
---|---|
bin | 1010000110011101011100… |
… | …10010101100000011001110 |
3 | 2220122110120102002101101010 |
4 | 11003032232102230003032 |
5 | 10402411041201202342 |
6 | 115124051022030050 |
7 | 4451531010656610 |
oct | 503165622540316 |
9 | 86573512071333 |
10 | 22212200022222 |
11 | 7094160929311 |
12 | 25a8a58a18326 |
13 | c517a8593222 |
14 | 56b10d1d6db0 |
15 | 287bcc3b929c |
hex | 1433ae4ac0ce |
22212200022222 has 128 divisors (see below), whose sum is σ = 53197513850880. Its totient is φ = 6049184042880.
The previous prime is 22212200022217. The next prime is 22212200022263. The reversal of 22212200022222 is 22222000221222.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1150345104 + ... + 1150364412.
It is an arithmetic number, because the mean of its divisors is an integer number (415605576960).
Almost surely, 222212200022222 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 22212200022222, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (26598756925440).
22212200022222 is an abundant number, since it is smaller than the sum of its proper divisors (30985313828658).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22212200022222 is a wasteful number, since it uses less digits than its factorization.
22212200022222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32606.
The product of its (nonzero) digits is 1024, while the sum is 21.
Adding to 22212200022222 its reverse (22222000221222), we get a palindrome (44434200243444).
The spelling of 22212200022222 in words is "twenty-two trillion, two hundred twelve billion, two hundred million, twenty-two thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •