Base | Representation |
---|---|
bin | 10100100001101100… |
… | …110010001010111011 |
3 | 2002220000120102001000 |
4 | 110201230302022323 |
5 | 330114244140233 |
6 | 14043010300043 |
7 | 1410114550056 |
oct | 244154621273 |
9 | 62800512030 |
10 | 22040224443 |
11 | 939014a926 |
12 | 4331287623 |
13 | 2103296a33 |
14 | 10d1251a9d |
15 | 88ee26d13 |
hex | 521b322bb |
22040224443 has 8 divisors (see below), whose sum is σ = 32652184400. Its totient is φ = 14693482944.
The previous prime is 22040224441. The next prime is 22040224477. The reversal of 22040224443 is 34442204022.
It is not a de Polignac number, because 22040224443 - 21 = 22040224441 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 816304609 = 22040224443 / (2 + 2 + 0 + 4 + 0 + 2 + 2 + 4 + 4 + 4 + 3).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (22040224441) 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, 408152278 + ... + 408152331.
It is an arithmetic number, because the mean of its divisors is an integer number (4081523050).
Almost surely, 222040224443 is an apocalyptic number.
22040224443 is a deficient number, since it is larger than the sum of its proper divisors (10611959957).
22040224443 is an equidigital number, since it uses as much as digits as its factorization.
22040224443 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 816304618 (or 816304612 counting only the distinct ones).
The product of its (nonzero) digits is 12288, while the sum is 27.
Adding to 22040224443 its reverse (34442204022), we get a palindrome (56482428465).
The spelling of 22040224443 in words is "twenty-two billion, forty million, two hundred twenty-four thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.135 sec. • engine limits •