Base | Representation |
---|---|
bin | 1100010111101010… |
… | …00010011000010001 |
3 | 122010211000212021012 |
4 | 12023311002120101 |
5 | 102100032404242 |
6 | 3014545340305 |
7 | 323365515161 |
oct | 61365023021 |
9 | 18124025235 |
10 | 6640903697 |
11 | 28a868726a |
12 | 1354037695 |
13 | 81aab661c |
14 | 46dda25a1 |
15 | 28d035282 |
hex | 18bd42611 |
6640903697 has 8 divisors (see below), whose sum is σ = 6687760992. Its totient is φ = 6594206400.
The previous prime is 6640903673. The next prime is 6640903721. The reversal of 6640903697 is 7963090466.
6640903697 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (6640903673) and next prime (6640903721).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 6640903697 - 226 = 6573794833 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (6640903637) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 43922 + ... + 123332.
It is an arithmetic number, because the mean of its divisors is an integer number (835970124).
Almost surely, 26640903697 is an apocalyptic number.
It is an amenable number.
6640903697 is a deficient number, since it is larger than the sum of its proper divisors (46857295).
6640903697 is a wasteful number, since it uses less digits than its factorization.
6640903697 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 79999.
The product of its (nonzero) digits is 1469664, while the sum is 50.
The square root of 6640903697 is about 81491.7400538239. The cubic root of 6640903697 is about 1879.6445398012.
The spelling of 6640903697 in words is "six billion, six hundred forty million, nine hundred three thousand, six hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •