Base | Representation |
---|---|
bin | 1101000011010110111… |
… | …1111000000110101101 |
3 | 210102210200012102111001 |
4 | 3100311233320012231 |
5 | 12133220422324123 |
6 | 251003042200301 |
7 | 22125606624412 |
oct | 3206557700655 |
9 | 712720172431 |
10 | 224240042413 |
11 | 87110726902 |
12 | 37561653091 |
13 | 181b828273a |
14 | abd3564109 |
15 | 5c7657e0ad |
hex | 3435bf81ad |
224240042413 has 2 divisors, whose sum is σ = 224240042414. Its totient is φ = 224240042412.
The previous prime is 224240042381. The next prime is 224240042431. The reversal of 224240042413 is 314240042422.
Together with next prime (224240042431) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 168561976969 + 55678065444 = 410563^2 + 235962^2 .
It is a cyclic number.
It is not a de Polignac number, because 224240042413 - 25 = 224240042381 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (224240042113) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 112120021206 + 112120021207.
It is an arithmetic number, because the mean of its divisors is an integer number (112120021207).
Almost surely, 2224240042413 is an apocalyptic number.
It is an amenable number.
224240042413 is a deficient number, since it is larger than the sum of its proper divisors (1).
224240042413 is an equidigital number, since it uses as much as digits as its factorization.
224240042413 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12288, while the sum is 28.
Adding to 224240042413 its reverse (314240042422), we get a palindrome (538480084835).
Subtracting 224240042413 from its reverse (314240042422), we obtain a palindrome (90000000009).
The spelling of 224240042413 in words is "two hundred twenty-four billion, two hundred forty million, forty-two thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •