Base | Representation |
---|---|
bin | 110011000011100011000110… |
… | …100111010111111101110101 |
3 | 1002110001012212221022222010001 |
4 | 303003203012213113331311 |
5 | 213412413031421223204 |
6 | 2113322105225231301 |
7 | 65203533104656435 |
oct | 6303430647277565 |
9 | 1073035787288101 |
10 | 224544222445429 |
11 | 65601740795207 |
12 | 21226211932531 |
13 | 983a5772a5883 |
14 | 3d63dd96ac2c5 |
15 | 1ae5d9d0604a4 |
hex | cc38c69d7f75 |
224544222445429 has 2 divisors, whose sum is σ = 224544222445430. Its totient is φ = 224544222445428.
The previous prime is 224544222445399. The next prime is 224544222445441. The reversal of 224544222445429 is 924544222445422.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 170932875256900 + 53611347188529 = 13074130^2 + 7321977^2 .
It is a cyclic number.
It is not a de Polignac number, because 224544222445429 - 241 = 222345199189877 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 224544222445429.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (224544220445429) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 112272111222714 + 112272111222715.
It is an arithmetic number, because the mean of its divisors is an integer number (112272111222715).
Almost surely, 2224544222445429 is an apocalyptic number.
It is an amenable number.
224544222445429 is a deficient number, since it is larger than the sum of its proper divisors (1).
224544222445429 is an equidigital number, since it uses as much as digits as its factorization.
224544222445429 is an evil number, because the sum of its binary digits is even.
The product of its digits is 58982400, while the sum is 55.
The spelling of 224544222445429 in words is "two hundred twenty-four trillion, five hundred forty-four billion, two hundred twenty-two million, four hundred forty-five thousand, four hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •