Base | Representation |
---|---|
bin | 100000010110101111111000… |
… | …011111101100111011010111 |
3 | 200122211211001120122220001022 |
4 | 200112233320133230323113 |
5 | 122122423344004400311 |
6 | 1222352015251151355 |
7 | 41654613521163056 |
oct | 4026577037547327 |
9 | 618754046586038 |
10 | 142300730543831 |
11 | 4138344568a762 |
12 | 13b62a028a555b |
13 | 6152b94248412 |
14 | 271d56bd2839d |
15 | 116b87dd805db |
hex | 816bf87eced7 |
142300730543831 has 2 divisors, whose sum is σ = 142300730543832. Its totient is φ = 142300730543830.
The previous prime is 142300730543827. The next prime is 142300730543833. The reversal of 142300730543831 is 138345037003241.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 142300730543831 - 22 = 142300730543827 is a prime.
It is a super-2 number, since 2×1423007305438312 (a number of 29 digits) contains 22 as substring.
Together with 142300730543833, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (142300730543833) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 71150365271915 + 71150365271916.
It is an arithmetic number, because the mean of its divisors is an integer number (71150365271916).
Almost surely, 2142300730543831 is an apocalyptic number.
142300730543831 is a deficient number, since it is larger than the sum of its proper divisors (1).
142300730543831 is an equidigital number, since it uses as much as digits as its factorization.
142300730543831 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 725760, while the sum is 44.
The spelling of 142300730543831 in words is "one hundred forty-two trillion, three hundred billion, seven hundred thirty million, five hundred forty-three thousand, eight hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •