Base | Representation |
---|---|
bin | 110100010101111111… |
… | …1010000010111111101 |
3 | 101202010211212222022111 |
4 | 1220223333100113331 |
5 | 3320202212332000 |
6 | 123350015214021 |
7 | 11056361012452 |
oct | 1505377202775 |
9 | 352124788274 |
10 | 112407152125 |
11 | 437429a8134 |
12 | 19950b17311 |
13 | a7a511b088 |
14 | 5624b85829 |
15 | 2dcd5d2cba |
hex | 1a2bfd05fd |
112407152125 has 8 divisors (see below), whose sum is σ = 140284126008. Its totient is φ = 89925721600.
The previous prime is 112407152083. The next prime is 112407152129. The reversal of 112407152125 is 521251704211.
It can be written as a sum of positive squares in 4 ways, for example, as 6148755396 + 106258396729 = 78414^2 + 325973^2 .
It is not a de Polignac number, because 112407152125 - 221 = 112405054973 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112407152129) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 449628484 + ... + 449628733.
It is an arithmetic number, because the mean of its divisors is an integer number (17535515751).
Almost surely, 2112407152125 is an apocalyptic number.
It is an amenable number.
112407152125 is a deficient number, since it is larger than the sum of its proper divisors (27876973883).
112407152125 is an frugal number, since it uses more digits than its factorization.
112407152125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 899257232 (or 899257222 counting only the distinct ones).
The product of its (nonzero) digits is 5600, while the sum is 31.
Adding to 112407152125 its reverse (521251704211), we get a palindrome (633658856336).
The spelling of 112407152125 in words is "one hundred twelve billion, four hundred seven million, one hundred fifty-two thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •