Base | Representation |
---|---|
bin | 1001110001001111… |
… | …10101110100011101 |
3 | 111112112021022211122 |
4 | 10320213311310131 |
5 | 41220200413303 |
6 | 2224241100325 |
7 | 243655134002 |
oct | 47047656435 |
9 | 14475238748 |
10 | 5244935453 |
11 | 22516a16aa |
12 | 10246276a5 |
13 | 65781a004 |
14 | 37a81d8a9 |
15 | 20a6d9e38 |
hex | 1389f5d1d |
5244935453 has 2 divisors, whose sum is σ = 5244935454. Its totient is φ = 5244935452.
The previous prime is 5244935431. The next prime is 5244935461. The reversal of 5244935453 is 3545394425.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4830528004 + 414407449 = 69502^2 + 20357^2 .
It is a cyclic number.
It is not a de Polignac number, because 5244935453 - 220 = 5243886877 is a prime.
It is a super-2 number, since 2×52449354532 = 55018695812272630418, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5244935483) 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, 2622467726 + 2622467727.
It is an arithmetic number, because the mean of its divisors is an integer number (2622467727).
Almost surely, 25244935453 is an apocalyptic number.
It is an amenable number.
5244935453 is a deficient number, since it is larger than the sum of its proper divisors (1).
5244935453 is an equidigital number, since it uses as much as digits as its factorization.
5244935453 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1296000, while the sum is 44.
The square root of 5244935453 is about 72421.9266037572. The cubic root of 5244935453 is about 1737.4542696105.
The spelling of 5244935453 in words is "five billion, two hundred forty-four million, nine hundred thirty-five thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •