Base | Representation |
---|---|
bin | 1010000011110001101111… |
… | …11100010001000111010110 |
3 | 2220022122122020100011121021 |
4 | 11001320313330101013112 |
5 | 10344403300122320042 |
6 | 115013444050511354 |
7 | 4442055501511216 |
oct | 501706774210726 |
9 | 86278566304537 |
10 | 22120020120022 |
11 | 7059058765460 |
12 | 2593011b9555a |
13 | c45ba7c583b6 |
14 | 5668869b0246 |
15 | 2855d4990867 |
hex | 141e37f111d6 |
22120020120022 has 32 divisors (see below), whose sum is σ = 36215526531744. Its totient is φ = 10049241696000.
The previous prime is 22120020120013. The next prime is 22120020120071. The reversal of 22120020120022 is 22002102002122.
It is a super-2 number, since 2×221200201200222 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 22120020119978 and 22120020120005.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 647581368 + ... + 647615524.
It is an arithmetic number, because the mean of its divisors is an integer number (1131735204117).
Almost surely, 222120020120022 is an apocalyptic number.
22120020120022 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
22120020120022 is a deficient number, since it is larger than the sum of its proper divisors (14095506411722).
22120020120022 is a wasteful number, since it uses less digits than its factorization.
22120020120022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48864.
The product of its (nonzero) digits is 128, while the sum is 16.
Adding to 22120020120022 its reverse (22002102002122), we get a palindrome (44122122122144).
The spelling of 22120020120022 in words is "twenty-two trillion, one hundred twenty billion, twenty million, one hundred twenty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •