Base | Representation |
---|---|
bin | 10100101011001110… |
… | …010001111000010101 |
3 | 2010022011012211221000 |
4 | 110223032101320111 |
5 | 330431200000041 |
6 | 14110515013513 |
7 | 1414064613063 |
oct | 245316217025 |
9 | 63264184830 |
10 | 22200000021 |
11 | 9462359661 |
12 | 437689a299 |
13 | 212a4092b4 |
14 | 1108563033 |
15 | 89de87bb6 |
hex | 52b391e15 |
22200000021 has 8 divisors (see below), whose sum is σ = 32888888960. Its totient is φ = 14799999996.
The previous prime is 22199999977. The next prime is 22200000049. The reversal of 22200000021 is 12000000222.
It is not a de Polignac number, because 22200000021 - 218 = 22199737877 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 22199999949 and 22200000012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22200000071) 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 7 ways as a sum of consecutive naturals, for example, 411111085 + ... + 411111138.
It is an arithmetic number, because the mean of its divisors is an integer number (4111111120).
Almost surely, 222200000021 is an apocalyptic number.
It is an amenable number.
22200000021 is a deficient number, since it is larger than the sum of its proper divisors (10688888939).
22200000021 is an equidigital number, since it uses as much as digits as its factorization.
22200000021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 822222232 (or 822222226 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 9.
Adding to 22200000021 its reverse (12000000222), we get a palindrome (34200000243).
The spelling of 22200000021 in words is "twenty-two billion, two hundred million, twenty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •