Base | Representation |
---|---|
bin | 10010010101110101001111… |
… | …001110111101011011001001 |
3 | 101120121111202012212021000002 |
4 | 102111311033032331123021 |
5 | 41033104121141422344 |
6 | 443321012350252345 |
7 | 22663601424551561 |
oct | 2225651716753311 |
9 | 346544665767002 |
10 | 80665110107849 |
11 | 2377a9767a2423 |
12 | 90695321b70b5 |
13 | 36018c1b4a957 |
14 | 15cc2d8251da1 |
15 | 94d44096044e |
hex | 495d4f3bd6c9 |
80665110107849 has 2 divisors, whose sum is σ = 80665110107850. Its totient is φ = 80665110107848.
The previous prime is 80665110107833. The next prime is 80665110107867. The reversal of 80665110107849 is 94870101156608.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 80652846760249 + 12263347600 = 8980693^2 + 110740^2 .
It is a cyclic number.
It is not a de Polignac number, because 80665110107849 - 24 = 80665110107833 is a prime.
It is a super-2 number, since 2×806651101078492 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 80665110107794 and 80665110107803.
It is not a weakly prime, because it can be changed into another prime (80665110107819) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 40332555053924 + 40332555053925.
It is an arithmetic number, because the mean of its divisors is an integer number (40332555053925).
Almost surely, 280665110107849 is an apocalyptic number.
It is an amenable number.
80665110107849 is a deficient number, since it is larger than the sum of its proper divisors (1).
80665110107849 is an equidigital number, since it uses as much as digits as its factorization.
80665110107849 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2903040, while the sum is 56.
The spelling of 80665110107849 in words is "eighty trillion, six hundred sixty-five billion, one hundred ten million, one hundred seven thousand, eight hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •