Base | Representation |
---|---|
bin | 1111010001000101… |
… | …01000011001110101 |
3 | 210011012220012220101 |
4 | 13220202220121311 |
5 | 113241232003142 |
6 | 3433152234101 |
7 | 410053623463 |
oct | 75042503165 |
9 | 23135805811 |
10 | 8196359797 |
11 | 35266a447a |
12 | 1708b3b931 |
13 | a08124552 |
14 | 57a7bd833 |
15 | 32e8860b7 |
hex | 1e88a8675 |
8196359797 has 2 divisors, whose sum is σ = 8196359798. Its totient is φ = 8196359796.
The previous prime is 8196359779. The next prime is 8196359819. The reversal of 8196359797 is 7979536918.
8196359797 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
Together with previous prime (8196359779) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4371060996 + 3825298801 = 66114^2 + 61849^2 .
It is a cyclic number.
It is not a de Polignac number, because 8196359797 - 211 = 8196357749 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (8196359737) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 4098179898 + 4098179899.
It is an arithmetic number, because the mean of its divisors is an integer number (4098179899).
Almost surely, 28196359797 is an apocalyptic number.
It is an amenable number.
8196359797 is a deficient number, since it is larger than the sum of its proper divisors (1).
8196359797 is an equidigital number, since it uses as much as digits as its factorization.
8196359797 is an evil number, because the sum of its binary digits is even.
The product of its digits is 25719120, while the sum is 64.
The square root of 8196359797 is about 90533.7494915570. The cubic root of 8196359797 is about 2016.2312335974.
The spelling of 8196359797 in words is "eight billion, one hundred ninety-six million, three hundred fifty-nine thousand, seven hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •