Base | Representation |
---|---|
bin | 10100100101110111… |
… | …000010000110110101 |
3 | 2010001212220101120102 |
4 | 110211313002012311 |
5 | 330240131120041 |
6 | 14053542243445 |
7 | 1411623032525 |
oct | 244567020665 |
9 | 63055811512 |
10 | 22110020021 |
11 | 9416591321 |
12 | 4350726585 |
13 | 21148934ab |
14 | 10da61d685 |
15 | 89611209b |
hex | 525dc21b5 |
22110020021 has 16 divisors (see below), whose sum is σ = 24134468400. Its totient is φ = 20172472320.
The previous prime is 22110020003. The next prime is 22110020029. The reversal of 22110020021 is 12002001122.
It is a happy number.
It can be written as a sum of positive squares in 8 ways, for example, as 3205144996 + 18904875025 = 56614^2 + 137495^2 .
It is not a de Polignac number, because 22110020021 - 226 = 22042911157 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 22110019984 and 22110020011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22110020029) by changing a digit.
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 in 15 ways as a sum of consecutive naturals, for example, 8405 + ... + 210453.
It is an arithmetic number, because the mean of its divisors is an integer number (1508404275).
Almost surely, 222110020021 is an apocalyptic number.
It is an amenable number.
22110020021 is a deficient number, since it is larger than the sum of its proper divisors (2024448379).
22110020021 is a wasteful number, since it uses less digits than its factorization.
22110020021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 202264.
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 22110020021 its reverse (12002001122), we get a palindrome (34112021143).
The spelling of 22110020021 in words is "twenty-two billion, one hundred ten million, twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •