Base | Representation |
---|---|
bin | 110100100010011110… |
… | …0110010111100010000 |
3 | 101210020000220111002121 |
4 | 1221010330302330100 |
5 | 3322031420001210 |
6 | 123455335224024 |
7 | 11102634434551 |
oct | 1510474627420 |
9 | 353200814077 |
10 | 112825937680 |
11 | 439383339a5 |
12 | 19a49218014 |
13 | a840b09091 |
14 | 566463a328 |
15 | 2e052576da |
hex | 1a44f32f10 |
112825937680 has 40 divisors (see below), whose sum is σ = 262338399000. Its totient is φ = 45127262208.
The previous prime is 112825937677. The next prime is 112825937717. The reversal of 112825937680 is 86739528211.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 56288511504 + 56537426176 = 237252^2 + 237776^2 .
It is a tau number, because it is divible by the number of its divisors (40).
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 7 ways as a sum of consecutive naturals, for example, 1378546 + ... + 1458094.
It is an arithmetic number, because the mean of its divisors is an integer number (6558459975).
Almost surely, 2112825937680 is an apocalyptic number.
112825937680 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
112825937680 is an abundant number, since it is smaller than the sum of its proper divisors (149512461320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112825937680 is a wasteful number, since it uses less digits than its factorization.
112825937680 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 97291 (or 97285 counting only the distinct ones).
The product of its (nonzero) digits is 1451520, while the sum is 52.
The spelling of 112825937680 in words is "one hundred twelve billion, eight hundred twenty-five million, nine hundred thirty-seven thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •