Base | Representation |
---|---|
bin | 1001011010001000… |
… | …00011110010101101 |
3 | 111001000100200210221 |
4 | 10231010003302231 |
5 | 40321024144000 |
6 | 2153112331341 |
7 | 236111562244 |
oct | 45504036255 |
9 | 14030320727 |
10 | 5051006125 |
11 | 2162185730 |
12 | b8b6a3b51 |
13 | 6265a9c29 |
14 | 35cb7b95b |
15 | 1e867e61a |
hex | 12d103cad |
5051006125 has 64 divisors (see below), whose sum is σ = 7161073920. Its totient is φ = 3523296000.
The previous prime is 5051006099. The next prime is 5051006141. The reversal of 5051006125 is 5216001505.
It is not a de Polignac number, because 5051006125 - 227 = 4916788397 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a self number, because there is not a number n which added to its sum of digits gives 5051006125.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 7855054 + ... + 7855696.
It is an arithmetic number, because the mean of its divisors is an integer number (111891780).
Almost surely, 25051006125 is an apocalyptic number.
5051006125 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
5051006125 is a deficient number, since it is larger than the sum of its proper divisors (2110067795).
5051006125 is a wasteful number, since it uses less digits than its factorization.
5051006125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 895 (or 885 counting only the distinct ones).
The product of its (nonzero) digits is 1500, while the sum is 25.
The square root of 5051006125 is about 71070.4307359960. The cubic root of 5051006125 is about 1715.7709023641.
It can be divided in two parts, 505100 and 6125, that added together give a square (511225 = 7152).
The spelling of 5051006125 in words is "five billion, fifty-one million, six thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •