Base | Representation |
---|---|
bin | 110100111111010010… |
… | …0011110001011110010 |
3 | 101212201101221001000020 |
4 | 1221332210132023302 |
5 | 3331021403432410 |
6 | 124135311104310 |
7 | 11135613323100 |
oct | 1517644361362 |
9 | 355641831006 |
10 | 113792639730 |
11 | 44293a84510 |
12 | 1a078b12096 |
13 | a966188123 |
14 | 5716b9ac70 |
15 | 2e6005ca70 |
hex | 1a7e91e2f2 |
113792639730 has 384 divisors, whose sum is σ = 370612869120. Its totient is φ = 22032783360.
The previous prime is 113792639657. The next prime is 113792639749. The reversal of 113792639730 is 37936297311.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 28311661 + ... + 28315679.
It is an arithmetic number, because the mean of its divisors is an integer number (965137680).
Almost surely, 2113792639730 is an apocalyptic number.
113792639730 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 113792639730, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (185306434560).
113792639730 is an abundant number, since it is smaller than the sum of its proper divisors (256820229390).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113792639730 is a wasteful number, since it uses less digits than its factorization.
113792639730 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4174 (or 4167 counting only the distinct ones).
The product of its (nonzero) digits is 1285956, while the sum is 51.
The spelling of 113792639730 in words is "one hundred thirteen billion, seven hundred ninety-two million, six hundred thirty-nine thousand, seven hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •