Base | Representation |
---|---|
bin | 1100010100010110011001111… |
… | …0111111001010111011011101 |
3 | 11012200002021112002011000122022 |
4 | 3011011212132333022323131 |
5 | 1402103123032011334142 |
6 | 12311310243244225525 |
7 | 350402145041312534 |
oct | 30505463677127335 |
9 | 4180067462130568 |
10 | 866800082136797 |
11 | 231209939a31096 |
12 | 812737b583b2a5 |
13 | 2b287b879812a3 |
14 | 114094c260131b |
15 | 6a326d53b16d2 |
hex | 314599efcaedd |
866800082136797 has 2 divisors, whose sum is σ = 866800082136798. Its totient is φ = 866800082136796.
The previous prime is 866800082136787. The next prime is 866800082136803. The reversal of 866800082136797 is 797631280008668.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 511744975611961 + 355055106524836 = 22621781^2 + 18842906^2 .
It is a cyclic number.
It is not a de Polignac number, because 866800082136797 - 242 = 862402035625693 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 866800082136797.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (866800082136727) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 433400041068398 + 433400041068399.
It is an arithmetic number, because the mean of its divisors is an integer number (433400041068399).
Almost surely, 2866800082136797 is an apocalyptic number.
It is an amenable number.
866800082136797 is a deficient number, since it is larger than the sum of its proper divisors (1).
866800082136797 is an equidigital number, since it uses as much as digits as its factorization.
866800082136797 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 292626432, while the sum is 71.
The spelling of 866800082136797 in words is "eight hundred sixty-six trillion, eight hundred billion, eighty-two million, one hundred thirty-six thousand, seven hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •