Base | Representation |
---|---|
bin | 1010000011001100101010… |
… | …10101100101000110111010 |
3 | 2220020202020211002001111121 |
4 | 11001212111111211012322 |
5 | 10344042012210400442 |
6 | 115000352411015454 |
7 | 4440452245132345 |
oct | 501462525450672 |
9 | 86222224061447 |
10 | 22100112200122 |
11 | 70506722085a0 |
12 | 258b196a3a58a |
13 | c44054680438 |
14 | 565918a1745c |
15 | 284d1bd62967 |
hex | 1419955651ba |
22100112200122 has 8 divisors (see below), whose sum is σ = 36163819963872. Its totient is φ = 10045505545500.
The previous prime is 22100112200083. The next prime is 22100112200129. The reversal of 22100112200122 is 22100221100122.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 22100112200096 and 22100112200105.
It is not an unprimeable number, because it can be changed into a prime (22100112200129) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 502275277254 + ... + 502275277297.
It is an arithmetic number, because the mean of its divisors is an integer number (4520477495484).
Almost surely, 222100112200122 is an apocalyptic number.
22100112200122 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
22100112200122 is a deficient number, since it is larger than the sum of its proper divisors (14063707763750).
22100112200122 is a wasteful number, since it uses less digits than its factorization.
22100112200122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1004550554564.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 22100112200122 its reverse (22100221100122), we get a palindrome (44200333300244).
The spelling of 22100112200122 in words is "twenty-two trillion, one hundred billion, one hundred twelve million, two hundred thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •