Base | Representation |
---|---|
bin | 110010111101100110011101… |
… | …111010100000101110010101 |
3 | 1002101121010221121020212102202 |
4 | 302331212131322200232111 |
5 | 213334214020012444221 |
6 | 2112410234012214245 |
7 | 65132154033662666 |
oct | 6275463572405625 |
9 | 1071533847225382 |
10 | 224135517703061 |
11 | 654643805a7058 |
12 | 2117ab6b46a385 |
13 | 980ab72414603 |
14 | 3d4c3073d136d |
15 | 1ada42c35dd0b |
hex | cbd99dea0b95 |
224135517703061 has 2 divisors, whose sum is σ = 224135517703062. Its totient is φ = 224135517703060.
The previous prime is 224135517703037. The next prime is 224135517703079. The reversal of 224135517703061 is 160307715531422.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 178498818519025 + 45636699184036 = 13360345^2 + 6755494^2 .
It is a cyclic number.
It is not a de Polignac number, because 224135517703061 - 230 = 224134443961237 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 224135517702997 and 224135517703015.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (224135517763061) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 112067758851530 + 112067758851531.
It is an arithmetic number, because the mean of its divisors is an integer number (112067758851531).
Almost surely, 2224135517703061 is an apocalyptic number.
It is an amenable number.
224135517703061 is a deficient number, since it is larger than the sum of its proper divisors (1).
224135517703061 is an equidigital number, since it uses as much as digits as its factorization.
224135517703061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1058400, while the sum is 47.
The spelling of 224135517703061 in words is "two hundred twenty-four trillion, one hundred thirty-five billion, five hundred seventeen million, seven hundred three thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •