Base | Representation |
---|---|
bin | 1001011010100111… |
… | …10001011000100111 |
3 | 111001022002221220000 |
4 | 10231103301120213 |
5 | 40323103000111 |
6 | 2153340512343 |
7 | 236161565565 |
oct | 45523613047 |
9 | 14038087800 |
10 | 5055125031 |
11 | 2164539290 |
12 | b90b4b6b3 |
13 | 6273bc958 |
14 | 35d530a35 |
15 | 1e8be4c56 |
hex | 12d4f1627 |
5055125031 has 40 divisors (see below), whose sum is σ = 8288759424. Its totient is φ = 3044828880.
The previous prime is 5055125029. The next prime is 5055125041. The reversal of 5055125031 is 1305215505.
5055125031 is a `hidden beast` number, since 505 + 5 + 125 + 0 + 31 = 666.
It is not a de Polignac number, because 5055125031 - 21 = 5055125029 is a prime.
It is a super-2 number, since 2×50551250312 = 51108578158085501922, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 5055124986 and 5055125004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5055125041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 127830 + ... + 162636.
Almost surely, 25055125031 is an apocalyptic number.
5055125031 is a deficient number, since it is larger than the sum of its proper divisors (3233634393).
5055125031 is a wasteful number, since it uses less digits than its factorization.
5055125031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34993 (or 34984 counting only the distinct ones).
The product of its (nonzero) digits is 3750, while the sum is 27.
The square root of 5055125031 is about 71099.4024658436. The cubic root of 5055125031 is about 1716.2371579163.
The spelling of 5055125031 in words is "five billion, fifty-five million, one hundred twenty-five thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •