Base | Representation |
---|---|
bin | 1001010111101111… |
… | …10110010110011101 |
3 | 110222121202201011000 |
4 | 10223313312112131 |
5 | 40300420400000 |
6 | 2151120220513 |
7 | 235450014324 |
oct | 45367662635 |
9 | 13877681130 |
10 | 5031028125 |
11 | 215197a992 |
12 | b84a6a739 |
13 | 622403826 |
14 | 35a25b0bb |
15 | 1e6a35000 |
hex | 12bdf659d |
5031028125 has 48 divisors (see below), whose sum is σ = 9316278720. Its totient is φ = 2683170000.
The previous prime is 5031028109. The next prime is 5031028159. The reversal of 5031028125 is 5218201305.
It is a happy number.
5031028125 is a `hidden beast` number, since 50 + 310 + 281 + 25 = 666.
5031028125 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 5031028125 - 24 = 5031028109 is a prime.
It is a super-2 number, since 2×50310281252 = 50622487989082031250, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 54562 + ... + 114188.
It is an arithmetic number, because the mean of its divisors is an integer number (194089140).
Almost surely, 25031028125 is an apocalyptic number.
It is an amenable number.
5031028125 is a deficient number, since it is larger than the sum of its proper divisors (4285250595).
5031028125 is an frugal number, since it uses more digits than its factorization.
5031028125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59661 (or 59635 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 27.
The square root of 5031028125 is about 70929.7407650698. The cubic root of 5031028125 is about 1713.5058115369.
The spelling of 5031028125 in words is "five billion, thirty-one million, twenty-eight thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •