Base | Representation |
---|---|
bin | 1001100001100011… |
… | …10001001010111101 |
3 | 111012100121120112212 |
4 | 10300301301022331 |
5 | 40433002221000 |
6 | 2203220110205 |
7 | 240466334564 |
oct | 46061611275 |
9 | 14170546485 |
10 | 5113320125 |
11 | 2194377101 |
12 | ba8535365 |
13 | 636487214 |
14 | 36715cbdb |
15 | 1edd8cc35 |
hex | 130c712bd |
5113320125 has 32 divisors (see below), whose sum is σ = 6563138400. Its totient is φ = 3974976000.
The previous prime is 5113320119. The next prime is 5113320133. The reversal of 5113320125 is 5210233115.
It is a happy number.
It can be written as a sum of positive squares in 16 ways, for example, as 5067446596 + 45873529 = 71186^2 + 6773^2 .
It is not a de Polignac number, because 5113320125 - 212 = 5113316029 is a prime.
It is a super-2 number, since 2×51133201252 = 52292085401460031250, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 5113320125.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1376771 + ... + 1380479.
It is an arithmetic number, because the mean of its divisors is an integer number (205098075).
Almost surely, 25113320125 is an apocalyptic number.
It is an amenable number.
5113320125 is a deficient number, since it is larger than the sum of its proper divisors (1449818275).
5113320125 is a wasteful number, since it uses less digits than its factorization.
5113320125 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4034 (or 4024 counting only the distinct ones).
The product of its (nonzero) digits is 900, while the sum is 23.
The square root of 5113320125 is about 71507.4830000329. The cubic root of 5113320125 is about 1722.7978761094.
The spelling of 5113320125 in words is "five billion, one hundred thirteen million, three hundred twenty thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •