Base | Representation |
---|---|
bin | 1100110110010001… |
… | …01001000100011101 |
3 | 122210201020112010221 |
4 | 12123020221010131 |
5 | 103111302414044 |
6 | 3100241401341 |
7 | 332634330613 |
oct | 63310510435 |
9 | 18721215127 |
10 | 6897701149 |
11 | 2a1a632a69 |
12 | 1406039251 |
13 | 85c068c91 |
14 | 49612b6b3 |
15 | 2a585d484 |
hex | 19b22911d |
6897701149 has 2 divisors, whose sum is σ = 6897701150. Its totient is φ = 6897701148.
The previous prime is 6897701147. The next prime is 6897701183. The reversal of 6897701149 is 9411077986.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4414672249 + 2483028900 = 66443^2 + 49830^2 .
It is a cyclic number.
It is not a de Polignac number, because 6897701149 - 21 = 6897701147 is a prime.
It is a super-2 number, since 2×68977011492 = 95156562281831840402, which contains 22 as substring.
Together with 6897701147, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 6897701096 and 6897701105.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (6897701141) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3448850574 + 3448850575.
It is an arithmetic number, because the mean of its divisors is an integer number (3448850575).
Almost surely, 26897701149 is an apocalyptic number.
It is an amenable number.
6897701149 is a deficient number, since it is larger than the sum of its proper divisors (1).
6897701149 is an equidigital number, since it uses as much as digits as its factorization.
6897701149 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 762048, while the sum is 52.
The square root of 6897701149 is about 83052.4000195058. The cubic root of 6897701149 is about 1903.5668132345.
The spelling of 6897701149 in words is "six billion, eight hundred ninety-seven million, seven hundred one thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •