Base | Representation |
---|---|
bin | 10100101011111100… |
… | …000100010011100011 |
3 | 2010022222210122222101 |
4 | 110223330010103203 |
5 | 330442233044133 |
6 | 14112024151231 |
7 | 1414301624236 |
oct | 245374042343 |
9 | 63288718871 |
10 | 22212003043 |
11 | 946910770a |
12 | 437a908517 |
13 | 212ca4c789 |
14 | 1109da941d |
15 | 8a005937d |
hex | 52bf044e3 |
22212003043 has 4 divisors (see below), whose sum is σ = 22212606640. Its totient is φ = 22211399448.
The previous prime is 22212003019. The next prime is 22212003053. The reversal of 22212003043 is 34030021222.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 34030021222 = 2 ⋅17015010611.
It is a cyclic number.
It is not a de Polignac number, because 22212003043 - 217 = 22211871971 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 22212003043.
It is not an unprimeable number, because it can be changed into a prime (22212003053) 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 3 ways as a sum of consecutive naturals, for example, 242748 + ... + 321481.
It is an arithmetic number, because the mean of its divisors is an integer number (5553151660).
Almost surely, 222212003043 is an apocalyptic number.
22212003043 is a deficient number, since it is larger than the sum of its proper divisors (603597).
22212003043 is an equidigital number, since it uses as much as digits as its factorization.
22212003043 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 603596.
The product of its (nonzero) digits is 576, while the sum is 19.
Adding to 22212003043 its reverse (34030021222), we get a palindrome (56242024265).
The spelling of 22212003043 in words is "twenty-two billion, two hundred twelve million, three thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •