Base | Representation |
---|---|
bin | 100000010100000000001110… |
… | …000010011100110001011011 |
3 | 200122011210012112020212211201 |
4 | 200110000032002130301123 |
5 | 122111331102013210321 |
6 | 1222125223103335031 |
7 | 41635155436055134 |
oct | 4024001602346133 |
9 | 618153175225751 |
10 | 142112113413211 |
11 | 41310455191827 |
12 | 13b323432b1477 |
13 | 613b165277b16 |
14 | 27143978dcc8b |
15 | 11669dedc8291 |
hex | 81400e09cc5b |
142112113413211 has 2 divisors, whose sum is σ = 142112113413212. Its totient is φ = 142112113413210.
The previous prime is 142112113413197. The next prime is 142112113413223. The reversal of 142112113413211 is 112314311211241.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 142112113413211 - 239 = 141562357599323 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 142112113413211.
It is not a weakly prime, because it can be changed into another prime (142112113413271) 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 as a sum of consecutive naturals, namely, 71056056706605 + 71056056706606.
It is an arithmetic number, because the mean of its divisors is an integer number (71056056706606).
Almost surely, 2142112113413211 is an apocalyptic number.
142112113413211 is a deficient number, since it is larger than the sum of its proper divisors (1).
142112113413211 is an equidigital number, since it uses as much as digits as its factorization.
142112113413211 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1152, while the sum is 28.
Adding to 142112113413211 its reverse (112314311211241), we get a palindrome (254426424624452).
The spelling of 142112113413211 in words is "one hundred forty-two trillion, one hundred twelve billion, one hundred thirteen million, four hundred thirteen thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •