Base | Representation |
---|---|
bin | 1001101001011110… |
… | …10101000011110001 |
3 | 111100222200120110112 |
4 | 10310233111003301 |
5 | 41102011231203 |
6 | 2213552511105 |
7 | 242234325161 |
oct | 46457250361 |
9 | 14328616415 |
10 | 5179789553 |
11 | 2218946614 |
12 | 100684b495 |
13 | 64718aa43 |
14 | 371d025a1 |
15 | 204b1c6d8 |
hex | 134bd50f1 |
5179789553 has 2 divisors, whose sum is σ = 5179789554. Its totient is φ = 5179789552.
The previous prime is 5179789523. The next prime is 5179789577. The reversal of 5179789553 is 3559879715.
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., 3977572624 + 1202216929 = 63068^2 + 34673^2 .
It is a cyclic number.
It is not a de Polignac number, because 5179789553 - 210 = 5179788529 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 5179789492 and 5179789501.
It is not a weakly prime, because it can be changed into another prime (5179789523) 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, 2589894776 + 2589894777.
It is an arithmetic number, because the mean of its divisors is an integer number (2589894777).
Almost surely, 25179789553 is an apocalyptic number.
It is an amenable number.
5179789553 is a deficient number, since it is larger than the sum of its proper divisors (1).
5179789553 is an equidigital number, since it uses as much as digits as its factorization.
5179789553 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 11907000, while the sum is 59.
The square root of 5179789553 is about 71970.7548452842. The cubic root of 5179789553 is about 1730.2307991720.
The spelling of 5179789553 in words is "five billion, one hundred seventy-nine million, seven hundred eighty-nine thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •