Base | Representation |
---|---|
bin | 110100010111010011… |
… | …0111110111000000100 |
3 | 101202020220121210210011 |
4 | 1220232212332320010 |
5 | 3320244441330034 |
6 | 123354225440004 |
7 | 11060433516532 |
oct | 1505646767004 |
9 | 352226553704 |
10 | 112451120644 |
11 | 437657a9355 |
12 | 199637a0004 |
13 | a7b1274055 |
14 | 562a94d152 |
15 | 2dd23ba864 |
hex | 1a2e9bee04 |
112451120644 has 24 divisors (see below), whose sum is σ = 197836775136. Its totient is φ = 55927032000.
The previous prime is 112451120641. The next prime is 112451120647. The reversal of 112451120644 is 446021154211.
112451120644 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (112451120641) and next prime (112451120647).
It is not an unprimeable number, because it can be changed into a prime (112451120641) by changing a digit.
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, 554199 + ... + 729409.
It is an arithmetic number, because the mean of its divisors is an integer number (8243198964).
Almost surely, 2112451120644 is an apocalyptic number.
It is an amenable number.
112451120644 is a deficient number, since it is larger than the sum of its proper divisors (85385654492).
112451120644 is a wasteful number, since it uses less digits than its factorization.
112451120644 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 176067 (or 176065 counting only the distinct ones).
The product of its (nonzero) digits is 7680, while the sum is 31.
Adding to 112451120644 its reverse (446021154211), we get a palindrome (558472274855).
The spelling of 112451120644 in words is "one hundred twelve billion, four hundred fifty-one million, one hundred twenty thousand, six hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •