Base | Representation |
---|---|
bin | 10011100100100111011001… |
… | …000011001001001011101101 |
3 | 102021210002011011100121112021 |
4 | 103210213121003021023231 |
5 | 42240304424222342203 |
6 | 503024103421110141 |
7 | 24063002605416145 |
oct | 2344473103111355 |
9 | 367702134317467 |
10 | 86079081059053 |
11 | 25477a2a1a9745 |
12 | 97a28520b8351 |
13 | 39052b7b2b084 |
14 | 173836d471925 |
15 | 9e41ab3715bd |
hex | 4e49d90c92ed |
86079081059053 has 2 divisors, whose sum is σ = 86079081059054. Its totient is φ = 86079081059052.
The previous prime is 86079081059029. The next prime is 86079081059087. The reversal of 86079081059053 is 35095018097068.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 48537444801924 + 37541636257129 = 6966882^2 + 6127123^2 .
It is a cyclic number.
It is not a de Polignac number, because 86079081059053 - 29 = 86079081058541 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 86079081058982 and 86079081059000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (86079081059093) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 43039540529526 + 43039540529527.
It is an arithmetic number, because the mean of its divisors is an integer number (43039540529527).
Almost surely, 286079081059053 is an apocalyptic number.
It is an amenable number.
86079081059053 is a deficient number, since it is larger than the sum of its proper divisors (1).
86079081059053 is an equidigital number, since it uses as much as digits as its factorization.
86079081059053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16329600, while the sum is 61.
The spelling of 86079081059053 in words is "eighty-six trillion, seventy-nine billion, eighty-one million, fifty-nine thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •