Base | Representation |
---|---|
bin | 11001101000101000100000… |
… | …011010001100000011101011 |
3 | 112210012011111211222122200212 |
4 | 121220220200122030003223 |
5 | 104234142023411143133 |
6 | 1035441341422251335 |
7 | 32514305266445654 |
oct | 3150504032140353 |
9 | 483164454878625 |
10 | 112743435256043 |
11 | 32a18249a94399 |
12 | 1078a524426b4b |
13 | 4aba8779732a7 |
14 | 1dbab5060a52b |
15 | d07aaeb4d148 |
hex | 668a2068c0eb |
112743435256043 has 2 divisors, whose sum is σ = 112743435256044. Its totient is φ = 112743435256042.
The previous prime is 112743435256027. The next prime is 112743435256079. The reversal of 112743435256043 is 340652534347211.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 112743435256043 - 24 = 112743435256027 is a prime.
It is a super-2 number, since 2×1127434352560432 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 112743435255982 and 112743435256000.
It is not a weakly prime, because it can be changed into another prime (112743435256003) 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 as a sum of consecutive naturals, namely, 56371717628021 + 56371717628022.
It is an arithmetic number, because the mean of its divisors is an integer number (56371717628022).
Almost surely, 2112743435256043 is an apocalyptic number.
112743435256043 is a deficient number, since it is larger than the sum of its proper divisors (1).
112743435256043 is an equidigital number, since it uses as much as digits as its factorization.
112743435256043 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7257600, while the sum is 50.
The spelling of 112743435256043 in words is "one hundred twelve trillion, seven hundred forty-three billion, four hundred thirty-five million, two hundred fifty-six thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •