Base | Representation |
---|---|
bin | 10010001101001100100101… |
… | …110011010110110110011001 |
3 | 101111111210002002222001001121 |
4 | 102031030211303112312121 |
5 | 40443343330114104012 |
6 | 442144234024245241 |
7 | 22602663415020211 |
oct | 2215144563266631 |
9 | 344453062861047 |
10 | 80071709519257 |
11 | 23571248616345 |
12 | 8b92525610821 |
13 | 358a964509c11 |
14 | 15ab6c464d241 |
15 | 93ccb017da07 |
hex | 48d325cd6d99 |
80071709519257 has 2 divisors, whose sum is σ = 80071709519258. Its totient is φ = 80071709519256.
The previous prime is 80071709519203. The next prime is 80071709519341. The reversal of 80071709519257 is 75291590717008.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 40143831559056 + 39927877960201 = 6335916^2 + 6318851^2 .
It is a cyclic number.
It is not a de Polignac number, because 80071709519257 - 231 = 80069562035609 is a prime.
It is a super-2 number, since 2×800717095192572 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 80071709519195 and 80071709519204.
It is not a weakly prime, because it can be changed into another prime (80071709517257) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 40035854759628 + 40035854759629.
It is an arithmetic number, because the mean of its divisors is an integer number (40035854759629).
Almost surely, 280071709519257 is an apocalyptic number.
It is an amenable number.
80071709519257 is a deficient number, since it is larger than the sum of its proper divisors (1).
80071709519257 is an equidigital number, since it uses as much as digits as its factorization.
80071709519257 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 11113200, while the sum is 61.
The spelling of 80071709519257 in words is "eighty trillion, seventy-one billion, seven hundred nine million, five hundred nineteen thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •