Base | Representation |
---|---|
bin | 1100010011111011… |
… | …10001101011001101 |
3 | 122001122012111201201 |
4 | 12021331301223031 |
5 | 102014031441031 |
6 | 3011511305501 |
7 | 322536004606 |
oct | 61175615315 |
9 | 18048174651 |
10 | 6609640141 |
11 | 2891a73515 |
12 | 134567b291 |
13 | 81448b490 |
14 | 469b84dad |
15 | 28a40bd61 |
hex | 189f71acd |
6609640141 has 8 divisors (see below), whose sum is σ = 7238720160. Its totient is φ = 5997795312.
The previous prime is 6609640117. The next prime is 6609640159. The reversal of 6609640141 is 1410469066.
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 6609640141 - 25 = 6609640109 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 6609640141.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6609620141) 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 in 7 ways as a sum of consecutive naturals, for example, 4307995 + ... + 4309528.
It is an arithmetic number, because the mean of its divisors is an integer number (904840020).
Almost surely, 26609640141 is an apocalyptic number.
It is an amenable number.
6609640141 is a deficient number, since it is larger than the sum of its proper divisors (629080019).
6609640141 is a wasteful number, since it uses less digits than its factorization.
6609640141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8617595.
The product of its (nonzero) digits is 31104, while the sum is 37.
The square root of 6609640141 is about 81299.6933635054. The cubic root of 6609640141 is about 1876.6902817423.
The spelling of 6609640141 in words is "six billion, six hundred nine million, six hundred forty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •