Base | Representation |
---|---|
bin | 110100001110001000… |
… | …0101111011101000111 |
3 | 101201110110101220211020 |
4 | 1220130100233131013 |
5 | 3314132141103143 |
6 | 123303512042223 |
7 | 11050005216510 |
oct | 1503420573507 |
9 | 351413356736 |
10 | 112143300423 |
11 | 43617a73480 |
12 | 19898693373 |
13 | a7625688cb |
14 | 55dbb01a07 |
15 | 2db5364883 |
hex | 1a1c42f747 |
112143300423 has 32 divisors (see below), whose sum is σ = 187536384000. Its totient is φ = 57907400160.
The previous prime is 112143300419. The next prime is 112143300431. The reversal of 112143300423 is 324003341211.
It is a happy number.
It is not a de Polignac number, because 112143300423 - 22 = 112143300419 is a prime.
It is a super-2 number, since 2×1121433004232 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 112143300393 and 112143300402.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112143300463) 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 31 ways as a sum of consecutive naturals, for example, 1414923 + ... + 1492076.
It is an arithmetic number, because the mean of its divisors is an integer number (5860512000).
Almost surely, 2112143300423 is an apocalyptic number.
112143300423 is a deficient number, since it is larger than the sum of its proper divisors (75393083577).
112143300423 is a wasteful number, since it uses less digits than its factorization.
112143300423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2907187.
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 112143300423 its reverse (324003341211), we get a palindrome (436146641634).
The spelling of 112143300423 in words is "one hundred twelve billion, one hundred forty-three million, three hundred thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •