Base | Representation |
---|---|
bin | 10100111001110101… |
… | …010110001010101101 |
3 | 2010221020110100101000 |
4 | 110321311112022231 |
5 | 331431422402341 |
6 | 14151112510513 |
7 | 1423132251054 |
oct | 247165261255 |
9 | 63836410330 |
10 | 22445122221 |
11 | 9578760595 |
12 | 44249ab439 |
13 | 2169131712 |
14 | 112cd2d39b |
15 | 8b57568b6 |
hex | 539d562ad |
22445122221 has 32 divisors (see below), whose sum is σ = 33437664000. Its totient is φ = 14880119040.
The previous prime is 22445122213. The next prime is 22445122229. The reversal of 22445122221 is 12222154422.
It is an interprime number because it is at equal distance from previous prime (22445122213) and next prime (22445122229).
It is not a de Polignac number, because 22445122221 - 23 = 22445122213 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22445122229) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3834505 + ... + 3840353.
It is an arithmetic number, because the mean of its divisors is an integer number (1044927000).
Almost surely, 222445122221 is an apocalyptic number.
It is an amenable number.
22445122221 is a deficient number, since it is larger than the sum of its proper divisors (10992541779).
22445122221 is a wasteful number, since it uses less digits than its factorization.
22445122221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6626 (or 6620 counting only the distinct ones).
The product of its digits is 5120, while the sum is 27.
Adding to 22445122221 its reverse (12222154422), we get a palindrome (34667276643).
The spelling of 22445122221 in words is "twenty-two billion, four hundred forty-five million, one hundred twenty-two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •