Base | Representation |
---|---|
bin | 10100100000000001… |
… | …100000011001001101 |
3 | 2002211001122122121020 |
4 | 110200001200121031 |
5 | 330040044232341 |
6 | 14040123424353 |
7 | 1406323532064 |
oct | 244001403115 |
9 | 62731578536 |
10 | 22012102221 |
11 | 937629221a |
12 | 43239850b9 |
13 | 20ca4cb675 |
14 | 10cb6111db |
15 | 88c71e566 |
hex | 52006064d |
22012102221 has 16 divisors (see below), whose sum is σ = 29603664000. Its totient is φ = 14548171968.
The previous prime is 22012102201. The next prime is 22012102241. The reversal of 22012102221 is 12220121022.
It is an interprime number because it is at equal distance from previous prime (22012102201) and next prime (22012102241).
It is not a de Polignac number, because 22012102221 - 26 = 22012102157 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 22012102221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22012102201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 98815 + ... + 231923.
It is an arithmetic number, because the mean of its divisors is an integer number (1850229000).
Almost surely, 222012102221 is an apocalyptic number.
It is an amenable number.
22012102221 is a deficient number, since it is larger than the sum of its proper divisors (7591561779).
22012102221 is a wasteful number, since it uses less digits than its factorization.
22012102221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 133588.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 22012102221 its reverse (12220121022), we get a palindrome (34232223243).
The spelling of 22012102221 in words is "twenty-two billion, twelve million, one hundred two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •