Base | Representation |
---|---|
bin | 1010000001000011… |
… | …10000111000111101 |
3 | 111212202211100200112 |
4 | 11000201300320331 |
5 | 42003123411000 |
6 | 2245335435405 |
7 | 250155335600 |
oct | 50041607075 |
9 | 14782740615 |
10 | 5377560125 |
11 | 230a546573 |
12 | 1060b25b65 |
13 | 679144352 |
14 | 3902a4337 |
15 | 217186235 |
hex | 140870e3d |
5377560125 has 36 divisors (see below), whose sum is σ = 7815241044. Its totient is φ = 3683534400.
The previous prime is 5377560121. The next prime is 5377560169. The reversal of 5377560125 is 5210657735.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
It can be written as a sum of positive squares in 6 ways, for example, as 4517721796 + 859838329 = 67214^2 + 29323^2 .
It is not a de Polignac number, because 5377560125 - 22 = 5377560121 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 (5377560121) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 5738657 + ... + 5739593.
It is an arithmetic number, because the mean of its divisors is an integer number (217090029).
Almost surely, 25377560125 is an apocalyptic number.
It is an amenable number.
5377560125 is a deficient number, since it is larger than the sum of its proper divisors (2437680919).
5377560125 is an frugal number, since it uses more digits than its factorization.
5377560125 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1903 (or 949 counting only the distinct ones).
The product of its (nonzero) digits is 220500, while the sum is 41.
The square root of 5377560125 is about 73331.8493221056. The cubic root of 5377560125 is about 1751.9770988237.
The spelling of 5377560125 in words is "five billion, three hundred seventy-seven million, five hundred sixty thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.032 sec. • engine limits •