Base | Representation |
---|---|
bin | 100101010100111001100… |
… | …1110011000011000000101 |
3 | 200011102202011120100202222 |
4 | 1022221303032120120011 |
5 | 1133022443232214000 |
6 | 14524425123342125 |
7 | 1036432154241302 |
oct | 112516316303005 |
9 | 20142664510688 |
10 | 5130124101125 |
11 | 16a8745349701 |
12 | 6aa304221945 |
13 | 2b29cb89a5ca |
14 | 13a4295180a9 |
15 | 8d6a63eaa85 |
hex | 4aa73398605 |
5130124101125 has 16 divisors (see below), whose sum is σ = 6410193294960. Its totient is φ = 4099100296000.
The previous prime is 5130124101101. The next prime is 5130124101143. The reversal of 5130124101125 is 5211014210315.
It can be written as a sum of positive squares in 8 ways, for example, as 3725726085796 + 1404398015329 = 1930214^2 + 1185073^2 .
It is not a de Polignac number, because 5130124101125 - 28 = 5130124100869 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5130124101094 and 5130124101103.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 24891890 + ... + 25097139.
It is an arithmetic number, because the mean of its divisors is an integer number (400637080935).
Almost surely, 25130124101125 is an apocalyptic number.
It is an amenable number.
5130124101125 is a deficient number, since it is larger than the sum of its proper divisors (1280069193835).
5130124101125 is an equidigital number, since it uses as much as digits as its factorization.
5130124101125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49989865 (or 49989855 counting only the distinct ones).
The product of its (nonzero) digits is 1200, while the sum is 26.
The spelling of 5130124101125 in words is "five trillion, one hundred thirty billion, one hundred twenty-four million, one hundred one thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •