Base | Representation |
---|---|
bin | 110100001110000111… |
… | …1101111111011010101 |
3 | 101201110102220200212211 |
4 | 1220130033233323111 |
5 | 3314132104241323 |
6 | 123303502313421 |
7 | 11050003054051 |
oct | 1503417577325 |
9 | 351412820784 |
10 | 112143040213 |
11 | 43617905a26 |
12 | 19898588871 |
13 | a7624a7339 |
14 | 55dba74c61 |
15 | 2db531270d |
hex | 1a1c3efed5 |
112143040213 has 2 divisors, whose sum is σ = 112143040214. Its totient is φ = 112143040212.
The previous prime is 112143040153. The next prime is 112143040241. The reversal of 112143040213 is 312040341211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 83270913489 + 28872126724 = 288567^2 + 169918^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-112143040213 is a prime.
It is a super-2 number, since 2×1121430402132 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (112143740213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56071520106 + 56071520107.
It is an arithmetic number, because the mean of its divisors is an integer number (56071520107).
Almost surely, 2112143040213 is an apocalyptic number.
It is an amenable number.
112143040213 is a deficient number, since it is larger than the sum of its proper divisors (1).
112143040213 is an equidigital number, since it uses as much as digits as its factorization.
112143040213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 112143040213 its reverse (312040341211), we get a palindrome (424183381424).
The spelling of 112143040213 in words is "one hundred twelve billion, one hundred forty-three million, forty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •