Base | Representation |
---|---|
bin | 1010000110101111101101… |
… | …00011000111000001000010 |
3 | 2220200101212112122200101211 |
4 | 11003113312203013001002 |
5 | 10403041130032033442 |
6 | 115132351421120334 |
7 | 4452325634203144 |
oct | 503276643070102 |
9 | 86611775580354 |
10 | 22222002221122 |
11 | 7098330a22440 |
12 | 25aa9336b90aa |
13 | c526ab2b6212 |
14 | 56b79cd8ac94 |
15 | 2880a2c04617 |
hex | 1435f68c7042 |
22222002221122 has 32 divisors (see below), whose sum is σ = 37945165474944. Its totient is φ = 9661516761600.
The previous prime is 22222002221113. The next prime is 22222002221171. The reversal of 22222002221122 is 22112220022222.
It is a super-2 number, since 2×222220022211222 (a number of 27 digits) contains 22 as substring.
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 a junction number, because it is equal to n+sod(n) for n = 22222002221093 and 22222002221102.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 22427248 + ... + 23397124.
It is an arithmetic number, because the mean of its divisors is an integer number (1185786421092).
Almost surely, 222222002221122 is an apocalyptic number.
22222002221122 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
22222002221122 is a deficient number, since it is larger than the sum of its proper divisors (15723163253822).
22222002221122 is a wasteful number, since it uses less digits than its factorization.
22222002221122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1015194.
The product of its (nonzero) digits is 1024, while the sum is 22.
Adding to 22222002221122 its reverse (22112220022222), we get a palindrome (44334222243344).
The spelling of 22222002221122 in words is "twenty-two trillion, two hundred twenty-two billion, two million, two hundred twenty-one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •