Base | Representation |
---|---|
bin | 1101000100000111001… |
… | …1001101110101000111 |
3 | 210110022202200100111101 |
4 | 3101001303031311013 |
5 | 12134124203310143 |
6 | 251035104120531 |
7 | 22133613412555 |
oct | 3210163156507 |
9 | 713282610441 |
10 | 224442244423 |
11 | 87204883201 |
12 | 375b9306147 |
13 | 1821b12b0b7 |
14 | ac1235abd5 |
15 | 5c891c0b4d |
hex | 3441ccdd47 |
224442244423 has 2 divisors, whose sum is σ = 224442244424. Its totient is φ = 224442244422.
The previous prime is 224442244399. The next prime is 224442244427. The reversal of 224442244423 is 324442244422.
224442244423 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-224442244423 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (224442244427) 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 as a sum of consecutive naturals, namely, 112221122211 + 112221122212.
It is an arithmetic number, because the mean of its divisors is an integer number (112221122212).
Almost surely, 2224442244423 is an apocalyptic number.
224442244423 is a deficient number, since it is larger than the sum of its proper divisors (1).
224442244423 is an equidigital number, since it uses as much as digits as its factorization.
224442244423 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 393216, while the sum is 37.
Adding to 224442244423 its reverse (324442244422), we get a palindrome (548884488845).
Subtracting 224442244423 from its reverse (324442244422), we obtain a palindrome (99999999999).
The spelling of 224442244423 in words is "two hundred twenty-four billion, four hundred forty-two million, two hundred forty-four thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •