Base | Representation |
---|---|
bin | 110100010110111110… |
… | …1101101001101000000 |
3 | 101202020011021002010121 |
4 | 1220231331231031000 |
5 | 3320234204102402 |
6 | 123353201510024 |
7 | 11060242532512 |
oct | 1505575551500 |
9 | 352204232117 |
10 | 112440300352 |
11 | 4375a688966 |
12 | 19960042314 |
13 | a7abc56003 |
14 | 5629333bb2 |
15 | 2dd147e837 |
hex | 1a2df6d340 |
112440300352 has 56 divisors (see below), whose sum is σ = 229065246720. Its totient is φ = 54735613440.
The previous prime is 112440300347. The next prime is 112440300419. The reversal of 112440300352 is 253003044211.
It is a super-2 number, since 2×1124403003522 (a number of 23 digits) contains 22 as substring.
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 7 ways as a sum of consecutive naturals, for example, 476674 + ... + 672382.
Almost surely, 2112440300352 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 112440300352, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (114532623360).
112440300352 is an abundant number, since it is smaller than the sum of its proper divisors (116624946368).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112440300352 is a wasteful number, since it uses less digits than its factorization.
112440300352 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 195959 (or 195949 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 25.
Adding to 112440300352 its reverse (253003044211), we get a palindrome (365443344563).
The spelling of 112440300352 in words is "one hundred twelve billion, four hundred forty million, three hundred thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •