Base | Representation |
---|---|
bin | 111010010000101001… |
… | …1001001111011100101 |
3 | 102221221022122202101010 |
4 | 1310201103021323211 |
5 | 4022212324034000 |
6 | 133250451452433 |
7 | 12016260403620 |
oct | 1644123117345 |
9 | 387838582333 |
10 | 125112721125 |
11 | 49072962187 |
12 | 202b7bb7119 |
13 | ba4b4c1a42 |
14 | 60ac38adb7 |
15 | 33c3c75d50 |
hex | 1d214c9ee5 |
125112721125 has 64 divisors (see below), whose sum is σ = 237997693440. Its totient is φ = 57177792000.
The previous prime is 125112721073. The next prime is 125112721133. The reversal of 125112721125 is 521127211521.
It is not a de Polignac number, because 125112721125 - 212 = 125112717029 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 125112721092 and 125112721101.
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 63 ways as a sum of consecutive naturals, for example, 17113971 + ... + 17121279.
It is an arithmetic number, because the mean of its divisors is an integer number (3718713960).
Almost surely, 2125112721125 is an apocalyptic number.
125112721125 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
125112721125 is a deficient number, since it is larger than the sum of its proper divisors (112884972315).
125112721125 is an equidigital number, since it uses as much as digits as its factorization.
125112721125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13855 (or 13845 counting only the distinct ones).
The product of its digits is 2800, while the sum is 30.
Adding to 125112721125 its reverse (521127211521), we get a palindrome (646239932646).
The spelling of 125112721125 in words is "one hundred twenty-five billion, one hundred twelve million, seven hundred twenty-one thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •