Base | Representation |
---|---|
bin | 100100011010110000110… |
… | …1000111101000010001101 |
3 | 122201111111020000012002211 |
4 | 1020311201220331002031 |
5 | 1124001300401304144 |
6 | 14351220330350421 |
7 | 1024422244511311 |
oct | 110654150750215 |
9 | 18644436005084 |
10 | 5005275025549 |
11 | 165a7a82a0307 |
12 | 68a08058b411 |
13 | 2a3cc2bb8266 |
14 | 134384199b41 |
15 | 8a2ea8a2034 |
hex | 48d61a3d08d |
5005275025549 has 2 divisors, whose sum is σ = 5005275025550. Its totient is φ = 5005275025548.
The previous prime is 5005275025519. The next prime is 5005275025591. The reversal of 5005275025549 is 9455205725005.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3501696323524 + 1503578702025 = 1871282^2 + 1226205^2 .
It is a cyclic number.
It is not a de Polignac number, because 5005275025549 - 223 = 5005266636941 is a prime.
It is a super-3 number, since 3×50052750255493 (a number of 39 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5005275025519) 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, 2502637512774 + 2502637512775.
It is an arithmetic number, because the mean of its divisors is an integer number (2502637512775).
Almost surely, 25005275025549 is an apocalyptic number.
It is an amenable number.
5005275025549 is a deficient number, since it is larger than the sum of its proper divisors (1).
5005275025549 is an equidigital number, since it uses as much as digits as its factorization.
5005275025549 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3150000, while the sum is 49.
The spelling of 5005275025549 in words is "five trillion, five billion, two hundred seventy-five million, twenty-five thousand, five hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.246 sec. • engine limits •