Base | Representation |
---|---|
bin | 1100010101111011… |
… | …01111000011110001 |
3 | 122002210202100001012 |
4 | 12022331233003301 |
5 | 102032330003031 |
6 | 3013310520305 |
7 | 323131345541 |
oct | 61275570361 |
9 | 18083670035 |
10 | 6626406641 |
11 | 28a0485428 |
12 | 134b206095 |
13 | 817aabb9a |
14 | 46c0ab321 |
15 | 28bb1eb2b |
hex | 18af6f0f1 |
6626406641 has 8 divisors (see below), whose sum is σ = 6721963200. Its totient is φ = 6530912080.
The previous prime is 6626406629. The next prime is 6626406653. The reversal of 6626406641 is 1466046266.
It is an interprime number because it is at equal distance from previous prime (6626406629) and next prime (6626406653).
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 6626406641 - 226 = 6559297777 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (6626405641) 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, 226850 + ... + 254388.
It is an arithmetic number, because the mean of its divisors is an integer number (840245400).
Almost surely, 26626406641 is an apocalyptic number.
It is an amenable number.
6626406641 is a deficient number, since it is larger than the sum of its proper divisors (95556559).
6626406641 is a wasteful number, since it uses less digits than its factorization.
6626406641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30999.
The product of its (nonzero) digits is 248832, while the sum is 41.
The square root of 6626406641 is about 81402.7434488544. The cubic root of 6626406641 is about 1878.2757921203.
The spelling of 6626406641 in words is "six billion, six hundred twenty-six million, four hundred six thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •