Base | Representation |
---|---|
bin | 1000010001011010101… |
… | …1100001110010011111 |
3 | 111120211012101001120112 |
4 | 2010112223201302133 |
5 | 4312022243230421 |
6 | 145141513240235 |
7 | 13160504503403 |
oct | 2042653416237 |
9 | 446735331515 |
10 | 142114430111 |
11 | 552a7988845 |
12 | 23661a0307b |
13 | 1052a962c84 |
14 | 6c42393103 |
15 | 3a6b68945b |
hex | 2116ae1c9f |
142114430111 has 2 divisors, whose sum is σ = 142114430112. Its totient is φ = 142114430110.
The previous prime is 142114430089. The next prime is 142114430149. The reversal of 142114430111 is 111034411241.
142114430111 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 142114430111 - 210 = 142114429087 is a prime.
It is a super-2 number, since 2×1421144301112 (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 (142114430011) 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, 71057215055 + 71057215056.
It is an arithmetic number, because the mean of its divisors is an integer number (71057215056).
Almost surely, 2142114430111 is an apocalyptic number.
142114430111 is a deficient number, since it is larger than the sum of its proper divisors (1).
142114430111 is an equidigital number, since it uses as much as digits as its factorization.
142114430111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 384, while the sum is 23.
Adding to 142114430111 its reverse (111034411241), we get a palindrome (253148841352).
The spelling of 142114430111 in words is "one hundred forty-two billion, one hundred fourteen million, four hundred thirty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •