Base | Representation |
---|---|
bin | 1001100001010011… |
… | …10001011100111101 |
3 | 111012012200002101020 |
4 | 10300221301130331 |
5 | 40431433133000 |
6 | 2203103134353 |
7 | 240442455030 |
oct | 46051613475 |
9 | 14165602336 |
10 | 5111224125 |
11 | 2193175377 |
12 | ba78a43b9 |
13 | 635c02197 |
14 | 366b75017 |
15 | 1edac6ba0 |
hex | 130a7173d |
5111224125 has 64 divisors (see below), whose sum is σ = 9761955840. Its totient is φ = 2326497600.
The previous prime is 5111224091. The next prime is 5111224147. The reversal of 5111224125 is 5214221115.
It is a happy number.
It is not a de Polignac number, because 5111224125 - 28 = 5111223869 is a prime.
It is a super-4 number, since 4×51112241254 (a number of 40 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 5111224095 and 5111224104.
It is a congruent number.
It is an unprimeable number.
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 63 ways as a sum of consecutive naturals, for example, 623302 + ... + 631448.
It is an arithmetic number, because the mean of its divisors is an integer number (152530560).
Almost surely, 25111224125 is an apocalyptic number.
It is an amenable number.
5111224125 is a deficient number, since it is larger than the sum of its proper divisors (4650731715).
5111224125 is a wasteful number, since it uses less digits than its factorization.
5111224125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8411 (or 8401 counting only the distinct ones).
The product of its digits is 800, while the sum is 24.
The square root of 5111224125 is about 71492.8256890158. The cubic root of 5111224125 is about 1722.5624466973.
The spelling of 5111224125 in words is "five billion, one hundred eleven million, two hundred twenty-four thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •