Base | Representation |
---|---|
bin | 100110100101101000111… |
… | …0101010010001100010001 |
3 | 200210000021201211010221121 |
4 | 1031023101311102030101 |
5 | 1143343042033041203 |
6 | 15140222054122241 |
7 | 1055110631421232 |
oct | 115132165221421 |
9 | 20700251733847 |
10 | 5303510049553 |
11 | 176522a184a61 |
12 | 717a32950381 |
13 | 2c617116a771 |
14 | 144996b41089 |
15 | 92e531250bd |
hex | 4d2d1d52311 |
5303510049553 has 2 divisors, whose sum is σ = 5303510049554. Its totient is φ = 5303510049552.
The previous prime is 5303510049521. The next prime is 5303510049623. The reversal of 5303510049553 is 3559400153035.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3146891506704 + 2156618542849 = 1773948^2 + 1468543^2 .
It is a cyclic number.
It is not a de Polignac number, because 5303510049553 - 25 = 5303510049521 is a prime.
It is not a weakly prime, because it can be changed into another prime (5303510049353) 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, 2651755024776 + 2651755024777.
It is an arithmetic number, because the mean of its divisors is an integer number (2651755024777).
Almost surely, 25303510049553 is an apocalyptic number.
It is an amenable number.
5303510049553 is a deficient number, since it is larger than the sum of its proper divisors (1).
5303510049553 is an equidigital number, since it uses as much as digits as its factorization.
5303510049553 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 607500, while the sum is 43.
The spelling of 5303510049553 in words is "five trillion, three hundred three billion, five hundred ten million, forty-nine thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •