Base | Representation |
---|---|
bin | 1010000110110000000111… |
… | …01001111011010111001000 |
3 | 2220200102102212102022020211 |
4 | 11003120003221323113020 |
5 | 10403042102330042300 |
6 | 115132425314130504 |
7 | 4452334244224045 |
oct | 503300351732710 |
9 | 86612385368224 |
10 | 22222222112200 |
11 | 7098434060900 |
12 | 25aa995280a34 |
13 | c52714a16196 |
14 | 56b7c026a1cc |
15 | 2880b718c4ba |
hex | 143603a7b5c8 |
22222222112200 has 72 divisors (see below), whose sum is σ = 56790633389490. Its totient is φ = 8080808032000.
The previous prime is 22222222112171. The next prime is 22222222112227. The reversal of 22222222112200 is 221122222222.
It can be written as a sum of positive squares in 3 ways, for example, as 19717276491396 + 2504945620804 = 4440414^2 + 1582702^2 .
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a zygodrome in base 10.
It is an unprimeable number.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 459112621 + ... + 459161020.
Almost surely, 222222222112200 is an apocalyptic number.
22222222112200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
22222222112200 is an abundant number, since it is smaller than the sum of its proper divisors (34568411277290).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22222222112200 is a wasteful number, since it uses less digits than its factorization.
22222222112200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 918273679 (or 918273659 counting only the distinct ones).
The product of its (nonzero) digits is 1024, while the sum is 22.
Adding to 22222222112200 its reverse (221122222222), we get a palindrome (22443344334422).
The spelling of 22222222112200 in words is "twenty-two trillion, two hundred twenty-two billion, two hundred twenty-two million, one hundred twelve thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •