Base | Representation |
---|---|
bin | 110100001101001001… |
… | …0111110100011011100 |
3 | 101201101011100221211010 |
4 | 1220122102332203130 |
5 | 3314100221111444 |
6 | 123300333255220 |
7 | 11046125046150 |
oct | 1503222764334 |
9 | 351334327733 |
10 | 112110332124 |
11 | 436003a594a |
12 | 19889634510 |
13 | a75879483b |
14 | 55d759d060 |
15 | 2db25012b9 |
hex | 1a1a4be8dc |
112110332124 has 48 divisors (see below), whose sum is σ = 314695673600. Its totient is φ = 30345653376.
The previous prime is 112110332111. The next prime is 112110332179. The reversal of 112110332124 is 421233011211.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a self number, because there is not a number n which added to its sum of digits gives 112110332124.
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 15 ways as a sum of consecutive naturals, for example, 35120689 + ... + 35123880.
Almost surely, 2112110332124 is an apocalyptic number.
112110332124 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
112110332124 is an abundant number, since it is smaller than the sum of its proper divisors (202585341476).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112110332124 is a wasteful number, since it uses less digits than its factorization.
112110332124 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 70244602 (or 70244600 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 112110332124 its reverse (421233011211), we get a palindrome (533343343335).
The spelling of 112110332124 in words is "one hundred twelve billion, one hundred ten million, three hundred thirty-two thousand, one hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •