Base | Representation |
---|---|
bin | 1001010000011111110… |
… | …0101100110111001001 |
3 | 120012112021020222201122 |
4 | 2110013330230313021 |
5 | 10101212032032412 |
6 | 201022032125025 |
7 | 14330223260021 |
oct | 2240774546711 |
9 | 505467228648 |
10 | 159047142857 |
11 | 614a6a69519 |
12 | 269a8696775 |
13 | 11cc8a27525 |
14 | 79ab158a81 |
15 | 420cebe572 |
hex | 2507f2cdc9 |
159047142857 has 2 divisors, whose sum is σ = 159047142858. Its totient is φ = 159047142856.
The previous prime is 159047142853. The next prime is 159047142889. The reversal of 159047142857 is 758241740951.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 153931460281 + 5115682576 = 392341^2 + 71524^2 .
It is an emirp because it is prime and its reverse (758241740951) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 159047142857 - 22 = 159047142853 is a prime.
It is a super-2 number, since 2×1590471428572 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 159047142799 and 159047142808.
It is not a weakly prime, because it can be changed into another prime (159047142853) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 79523571428 + 79523571429.
It is an arithmetic number, because the mean of its divisors is an integer number (79523571429).
Almost surely, 2159047142857 is an apocalyptic number.
It is an amenable number.
159047142857 is a deficient number, since it is larger than the sum of its proper divisors (1).
159047142857 is an equidigital number, since it uses as much as digits as its factorization.
159047142857 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2822400, while the sum is 53.
The spelling of 159047142857 in words is "one hundred fifty-nine billion, forty-seven million, one hundred forty-two thousand, eight hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •