Base | Representation |
---|---|
bin | 1010000110001000100101… |
… | …01110000100100000110110 |
3 | 2220121101122212022022200211 |
4 | 11003010102232010200312 |
5 | 10402220122001120042 |
6 | 115114555411100034 |
7 | 4450653322350145 |
oct | 503042256044066 |
9 | 86541585268624 |
10 | 22201000020022 |
11 | 708a43380694a |
12 | 25a6851ba161a |
13 | c507120b05a5 |
14 | 56a76994375c |
15 | 287773ec0017 |
hex | 143112b84836 |
22201000020022 has 4 divisors (see below), whose sum is σ = 33301500030036. Its totient is φ = 11100500010010.
The previous prime is 22201000020019. The next prime is 22201000020113. The reversal of 22201000020022 is 22002000010222.
It is a semiprime because it is the product of two primes.
It is a Smith number, since the sum of its digits (13) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a junction number, because it is equal to n+sod(n) for n = 22201000019984 and 22201000020011.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5550250005004 + ... + 5550250005007.
It is an arithmetic number, because the mean of its divisors is an integer number (8325375007509).
Almost surely, 222201000020022 is an apocalyptic number.
22201000020022 is a deficient number, since it is larger than the sum of its proper divisors (11100500010014).
22201000020022 is a wasteful number, since it uses less digits than its factorization.
22201000020022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11100500010013.
The product of its (nonzero) digits is 64, while the sum is 13.
Adding to 22201000020022 its reverse (22002000010222), we get a palindrome (44203000030244).
The spelling of 22201000020022 in words is "twenty-two trillion, two hundred one billion, twenty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •