Base | Representation |
---|---|
bin | 1010100000010100… |
… | …01000111101001001 |
3 | 112120001021122212101 |
4 | 11100022020331021 |
5 | 43022242141242 |
6 | 2331344313401 |
7 | 256521350314 |
oct | 52012107511 |
9 | 15501248771 |
10 | 5639802697 |
11 | 2434581271 |
12 | 1114912861 |
13 | 6bb582279 |
14 | 3b704997b |
15 | 2301d79b7 |
hex | 150288f49 |
5639802697 has 2 divisors, whose sum is σ = 5639802698. Its totient is φ = 5639802696.
The previous prime is 5639802677. The next prime is 5639802719. The reversal of 5639802697 is 7962089365.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4896640576 + 743162121 = 69976^2 + 27261^2 .
It is a cyclic number.
It is not a de Polignac number, because 5639802697 - 215 = 5639769929 is a prime.
It is a super-2 number, since 2×56398026972 = 63614748922176947618, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (5639802617) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2819901348 + 2819901349.
It is an arithmetic number, because the mean of its divisors is an integer number (2819901349).
Almost surely, 25639802697 is an apocalyptic number.
It is an amenable number.
5639802697 is a deficient number, since it is larger than the sum of its proper divisors (1).
5639802697 is an equidigital number, since it uses as much as digits as its factorization.
5639802697 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4898880, while the sum is 55.
The square root of 5639802697 is about 75098.6198075570. The cubic root of 5639802697 is about 1780.0053335909.
The spelling of 5639802697 in words is "five billion, six hundred thirty-nine million, eight hundred two thousand, six hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •