Base | Representation |
---|---|
bin | 100100010001101100001010… |
… | …101001011001010000010011 |
3 | 202220220101101021120100000101 |
4 | 210101230022221121100103 |
5 | 131402442313131034034 |
6 | 1323154040122433231 |
7 | 45414524656444045 |
oct | 4421541251312023 |
9 | 686811337510011 |
10 | 159545328768019 |
11 | 4692188082a137 |
12 | 15a88b53962817 |
13 | 6b040a191889c |
14 | 2b5806c4d5a95 |
15 | 136a217e70514 |
hex | 911b0aa59413 |
159545328768019 has 2 divisors, whose sum is σ = 159545328768020. Its totient is φ = 159545328768018.
The previous prime is 159545328767999. The next prime is 159545328768037. The reversal of 159545328768019 is 910867823545951.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 159545328768019 - 211 = 159545328765971 is a prime.
It is a super-2 number, since 2×1595453287680192 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (159545328718019) 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, 79772664384009 + 79772664384010.
It is an arithmetic number, because the mean of its divisors is an integer number (79772664384010).
It is a 1-persistent number, because it is pandigital, but 2⋅159545328768019 = 319090657536038 is not.
Almost surely, 2159545328768019 is an apocalyptic number.
159545328768019 is a deficient number, since it is larger than the sum of its proper divisors (1).
159545328768019 is an equidigital number, since it uses as much as digits as its factorization.
159545328768019 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 653184000, while the sum is 73.
The spelling of 159545328768019 in words is "one hundred fifty-nine trillion, five hundred forty-five billion, three hundred twenty-eight million, seven hundred sixty-eight thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •