Base | Representation |
---|---|
bin | 100100011000110100001100… |
… | …101101000000101001000101 |
3 | 202222122012021120200221110022 |
4 | 210120310030231000221011 |
5 | 131434003124310320312 |
6 | 1324211020444304525 |
7 | 45465101141366255 |
oct | 4430641455005105 |
9 | 688565246627408 |
10 | 160034989541957 |
11 | 46aa0504547002 |
12 | 15b47a2a242145 |
13 | 6b3b3089c5bca |
14 | 2b73a404d1965 |
15 | 1377d26039172 |
hex | 918d0cb40a45 |
160034989541957 has 2 divisors, whose sum is σ = 160034989541958. Its totient is φ = 160034989541956.
The previous prime is 160034989541789. The next prime is 160034989542023. The reversal of 160034989541957 is 759145989430061.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 147435109305796 + 12599880236161 = 12142286^2 + 3549631^2 .
It is a cyclic number.
It is not a de Polignac number, because 160034989541957 - 240 = 158935477914181 is a prime.
It is a super-2 number, since 2×1600349895419572 (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 (160034989547957) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 80017494770978 + 80017494770979.
It is an arithmetic number, because the mean of its divisors is an integer number (80017494770979).
Almost surely, 2160034989541957 is an apocalyptic number.
It is an amenable number.
160034989541957 is a deficient number, since it is larger than the sum of its proper divisors (1).
160034989541957 is an equidigital number, since it uses as much as digits as its factorization.
160034989541957 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 293932800, while the sum is 71.
The spelling of 160034989541957 in words is "one hundred sixty trillion, thirty-four billion, nine hundred eighty-nine million, five hundred forty-one thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •