Base | Representation |
---|---|
bin | 100000010010100010100001… |
… | …111010011000001001100111 |
3 | 200121211011112122210120212111 |
4 | 200102202201322120021213 |
5 | 122103204040332004431 |
6 | 1222011104524501451 |
7 | 41624664505435312 |
oct | 4022424172301147 |
9 | 617734478716774 |
10 | 142011515109991 |
11 | 4128182205765a |
12 | 13b169490aa887 |
13 | 6131822814c07 |
14 | 270d573217979 |
15 | 11640a33a87b1 |
hex | 8128a1e98267 |
142011515109991 has 2 divisors, whose sum is σ = 142011515109992. Its totient is φ = 142011515109990.
The previous prime is 142011515109953. The next prime is 142011515110019. The reversal of 142011515109991 is 199901515110241.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 142011515109991 - 29 = 142011515109479 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (142011519109991) 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, 71005757554995 + 71005757554996.
It is an arithmetic number, because the mean of its divisors is an integer number (71005757554996).
Almost surely, 2142011515109991 is an apocalyptic number.
142011515109991 is a deficient number, since it is larger than the sum of its proper divisors (1).
142011515109991 is an equidigital number, since it uses as much as digits as its factorization.
142011515109991 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 145800, while the sum is 49.
The spelling of 142011515109991 in words is "one hundred forty-two trillion, eleven billion, five hundred fifteen million, one hundred nine thousand, nine hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.170 sec. • engine limits •