Base | Representation |
---|---|
bin | 1111000000101111… |
… | …11110101100100101 |
3 | 202210200002101111221 |
4 | 13200113332230211 |
5 | 113001143143142 |
6 | 3411415500341 |
7 | 403501225432 |
oct | 74027765445 |
9 | 22720071457 |
10 | 8059349797 |
11 | 3466324874 |
12 | 168b0876b1 |
13 | 9b5923145 |
14 | 566516b89 |
15 | 322820767 |
hex | 1e05feb25 |
8059349797 has 2 divisors, whose sum is σ = 8059349798. Its totient is φ = 8059349796.
The previous prime is 8059349689. The next prime is 8059349807. The reversal of 8059349797 is 7979439508.
8059349797 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5775848001 + 2283501796 = 75999^2 + 47786^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-8059349797 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (8059346797) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 4029674898 + 4029674899.
It is an arithmetic number, because the mean of its divisors is an integer number (4029674899).
Almost surely, 28059349797 is an apocalyptic number.
It is an amenable number.
8059349797 is a deficient number, since it is larger than the sum of its proper divisors (1).
8059349797 is an equidigital number, since it uses as much as digits as its factorization.
8059349797 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 17146080, while the sum is 61.
The square root of 8059349797 is about 89773.8814856526. The cubic root of 8059349797 is about 2004.9336360271.
The spelling of 8059349797 in words is "eight billion, fifty-nine million, three hundred forty-nine thousand, seven hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •