Base | Representation |
---|---|
bin | 110000000100001101011… |
… | …1101110010000010000101 |
3 | 212101112112022101200122012 |
4 | 1200020122331302002011 |
5 | 1331213304144321311 |
6 | 22014450032544005 |
7 | 1251163421253113 |
oct | 140103275620205 |
9 | 25345468350565 |
10 | 6606112104581 |
11 | 2117700075650 |
12 | 8a83856b2005 |
13 | 38bc52377322 |
14 | 18ba47b04ab3 |
15 | b6c906d478b |
hex | 6021af72085 |
6606112104581 has 8 divisors (see below), whose sum is σ = 7206772994400. Its totient is φ = 6005468755440.
The previous prime is 6606112104569. The next prime is 6606112104617. The reversal of 6606112104581 is 1854012116066.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 6606112104581 - 26 = 6606112104517 is a prime.
It is a super-2 number, since 2×66061121045812 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6606112109581) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3591446 + ... + 5109863.
It is an arithmetic number, because the mean of its divisors is an integer number (900846624300).
Almost surely, 26606112104581 is an apocalyptic number.
It is an amenable number.
6606112104581 is a deficient number, since it is larger than the sum of its proper divisors (600660889819).
6606112104581 is a wasteful number, since it uses less digits than its factorization.
6606112104581 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8770339.
The product of its (nonzero) digits is 69120, while the sum is 41.
The spelling of 6606112104581 in words is "six trillion, six hundred six billion, one hundred twelve million, one hundred four thousand, five hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •