Base | Representation |
---|---|
bin | 1001110100101100… |
… | …01011010111100001 |
3 | 111121112200211020121 |
4 | 10322112023113201 |
5 | 41300102001203 |
6 | 2231153040241 |
7 | 244456031554 |
oct | 47226132741 |
9 | 14545624217 |
10 | 5273859553 |
11 | 2266a57816 |
12 | 1032256081 |
13 | 660806371 |
14 | 3805cc69b |
15 | 20d0000bd |
hex | 13a58b5e1 |
5273859553 has 2 divisors, whose sum is σ = 5273859554. Its totient is φ = 5273859552.
The previous prime is 5273859551. The next prime is 5273859559. The reversal of 5273859553 is 3559583725.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4614756624 + 659102929 = 67932^2 + 25673^2 .
It is a cyclic number.
It is not a de Polignac number, because 5273859553 - 21 = 5273859551 is a prime.
Together with 5273859551, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 5273859553.
It is not a weakly prime, because it can be changed into another prime (5273859551) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2636929776 + 2636929777.
It is an arithmetic number, because the mean of its divisors is an integer number (2636929777).
Almost surely, 25273859553 is an apocalyptic number.
It is an amenable number.
5273859553 is a deficient number, since it is larger than the sum of its proper divisors (1).
5273859553 is an equidigital number, since it uses as much as digits as its factorization.
5273859553 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 5670000, while the sum is 52.
The square root of 5273859553 is about 72621.3436463413. The cubic root of 5273859553 is about 1740.6422468384.
The spelling of 5273859553 in words is "five billion, two hundred seventy-three million, eight hundred fifty-nine thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •