Base | Representation |
---|---|
bin | 1011001100100101… |
… | …10001111011101001 |
3 | 120111221001220011010 |
4 | 11212102301323221 |
5 | 44302324311231 |
6 | 2432252054133 |
7 | 301651033410 |
oct | 54622617351 |
9 | 16457056133 |
10 | 6011166441 |
11 | 2605168355 |
12 | 11b9164349 |
13 | 74a4a8527 |
14 | 4104b8477 |
15 | 252ae1546 |
hex | 1664b1ee9 |
6011166441 has 8 divisors (see below), whose sum is σ = 9159872704. Its totient is φ = 3434952240.
The previous prime is 6011166433. The next prime is 6011166461. The reversal of 6011166441 is 1446611106.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 6011166441 - 23 = 6011166433 is a prime.
It is a super-2 number, since 2×60111664412 = 72268243962809212962, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 6011166399 and 6011166408.
It is not an unprimeable number, because it can be changed into a prime (6011166461) 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, 143122990 + ... + 143123031.
It is an arithmetic number, because the mean of its divisors is an integer number (1144984088).
Almost surely, 26011166441 is an apocalyptic number.
It is an amenable number.
6011166441 is a deficient number, since it is larger than the sum of its proper divisors (3148706263).
6011166441 is a wasteful number, since it uses less digits than its factorization.
6011166441 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 286246031.
The product of its (nonzero) digits is 3456, while the sum is 30.
The square root of 6011166441 is about 77531.7124859241. The cubic root of 6011166441 is about 1818.2471592405.
Adding to 6011166441 its reverse (1446611106), we get a palindrome (7457777547).
The spelling of 6011166441 in words is "six billion, eleven million, one hundred sixty-six thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •