Base | Representation |
---|---|
bin | 100110011010111011001… |
… | …1110101010001110000101 |
3 | 200200210220022011100111011 |
4 | 1030311312132222032011 |
5 | 1143003432123234100 |
6 | 15121455051442221 |
7 | 1053334530100201 |
oct | 114656636521605 |
9 | 20623808140434 |
10 | 5280502555525 |
11 | 17564a303718a |
12 | 713491756371 |
13 | 2c3c45686582 |
14 | 143813261b01 |
15 | 92558334bba |
hex | 4cd767aa385 |
5280502555525 has 12 divisors (see below), whose sum is σ = 6550321465764. Its totient is φ = 4222790240000.
The previous prime is 5280502555481. The next prime is 5280502555529. The reversal of 5280502555525 is 5255552050825.
It can be written as a sum of positive squares in 6 ways, for example, as 89172709924 + 5191329845601 = 298618^2 + 2278449^2 .
It is a de Polignac number, because none of the positive numbers 2k-5280502555525 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5280502555529) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 40228276 + ... + 40359325.
It is an arithmetic number, because the mean of its divisors is an integer number (545860122147).
Almost surely, 25280502555525 is an apocalyptic number.
It is an amenable number.
5280502555525 is a deficient number, since it is larger than the sum of its proper divisors (1269818910239).
5280502555525 is a wasteful number, since it uses less digits than its factorization.
5280502555525 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 80590232 (or 80590227 counting only the distinct ones).
The product of its (nonzero) digits is 5000000, while the sum is 49.
The spelling of 5280502555525 in words is "five trillion, two hundred eighty billion, five hundred two million, five hundred fifty-five thousand, five hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •