Base | Representation |
---|---|
bin | 110100010100011100… |
… | …1100000011110000111 |
3 | 101202000020100022011000 |
4 | 1220220321200132013 |
5 | 3320100430013133 |
6 | 123340524144343 |
7 | 11055161256534 |
oct | 1505071403607 |
9 | 352006308130 |
10 | 112355313543 |
11 | 43716711030 |
12 | 199376980b3 |
13 | a79746ab65 |
14 | 561bd2dd8b |
15 | 2dc8c93413 |
hex | 1a28e60787 |
112355313543 has 64 divisors (see below), whose sum is σ = 188702208000. Its totient is φ = 65454480000.
The previous prime is 112355313533. The next prime is 112355313569. The reversal of 112355313543 is 345313553211.
112355313543 is a `hidden beast` number, since 11 + 23 + 55 + 31 + 3 + 543 = 666.
It is not a de Polignac number, because 112355313543 - 24 = 112355313527 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 112355313498 and 112355313507.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112355313523) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1330893 + ... + 1412793.
It is an arithmetic number, because the mean of its divisors is an integer number (2948472000).
Almost surely, 2112355313543 is an apocalyptic number.
112355313543 is a deficient number, since it is larger than the sum of its proper divisors (76346894457).
112355313543 is a wasteful number, since it uses less digits than its factorization.
112355313543 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 82101 (or 82095 counting only the distinct ones).
The product of its digits is 81000, while the sum is 36.
Adding to 112355313543 its reverse (345313553211), we get a palindrome (457668866754).
The spelling of 112355313543 in words is "one hundred twelve billion, three hundred fifty-five million, three hundred thirteen thousand, five hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •