Base | Representation |
---|---|
bin | 100100010100001001101001… |
… | …010011110011001100101101 |
3 | 202221111112211120210210222022 |
4 | 210110021221103303030231 |
5 | 131413230113142322211 |
6 | 1323403443020555525 |
7 | 45432662143043642 |
oct | 4424115123631455 |
9 | 687445746723868 |
10 | 159714420667181 |
11 | 469875617a1746 |
12 | 15ab58843b2ba5 |
13 | 6b1700b6a0ca3 |
14 | 2b6230d703dc9 |
15 | 136e812bddbdb |
hex | 9142694f332d |
159714420667181 has 2 divisors, whose sum is σ = 159714420667182. Its totient is φ = 159714420667180.
The previous prime is 159714420667159. The next prime is 159714420667357. The reversal of 159714420667181 is 181766024417951.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 95624244925225 + 64090175741956 = 9778765^2 + 8005634^2 .
It is a cyclic number.
It is not a de Polignac number, because 159714420667181 - 242 = 155316374156077 is a prime.
It is a super-2 number, since 2×1597144206671812 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (159714420667121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 79857210333590 + 79857210333591.
It is an arithmetic number, because the mean of its divisors is an integer number (79857210333591).
Almost surely, 2159714420667181 is an apocalyptic number.
It is an amenable number.
159714420667181 is a deficient number, since it is larger than the sum of its proper divisors (1).
159714420667181 is an equidigital number, since it uses as much as digits as its factorization.
159714420667181 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 20321280, while the sum is 62.
The spelling of 159714420667181 in words is "one hundred fifty-nine trillion, seven hundred fourteen billion, four hundred twenty million, six hundred sixty-seven thousand, one hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •