Base | Representation |
---|---|
bin | 100000010010100010100001… |
… | …111010011000001010000011 |
3 | 200121211011112122210120220112 |
4 | 200102202201322120022003 |
5 | 122103204040332010034 |
6 | 1222011104524501535 |
7 | 41624664505435352 |
oct | 4022424172301203 |
9 | 617734478716815 |
10 | 142011515110019 |
11 | 41281822057685 |
12 | 13b169490aa8ab |
13 | 6131822814c29 |
14 | 270d573217999 |
15 | 11640a33a87ce |
hex | 8128a1e98283 |
142011515110019 has 2 divisors, whose sum is σ = 142011515110020. Its totient is φ = 142011515110018.
The previous prime is 142011515109991. The next prime is 142011515110027. The reversal of 142011515110019 is 910011515110241.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-142011515110019 is a prime.
It is a super-2 number, since 2×1420115151100192 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (142011515110039) 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, 71005757555009 + 71005757555010.
It is an arithmetic number, because the mean of its divisors is an integer number (71005757555010).
Almost surely, 2142011515110019 is an apocalyptic number.
142011515110019 is a deficient number, since it is larger than the sum of its proper divisors (1).
142011515110019 is an equidigital number, since it uses as much as digits as its factorization.
142011515110019 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1800, while the sum is 32.
The spelling of 142011515110019 in words is "one hundred forty-two trillion, eleven billion, five hundred fifteen million, one hundred ten thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •