Base | Representation |
---|---|
bin | 110001100010011111000… |
… | …0011000000111000101011 |
3 | 220002220002112121202120220 |
4 | 1203010332003000320223 |
5 | 1343022414410012421 |
6 | 22251451114421123 |
7 | 1301621365214121 |
oct | 143047603007053 |
9 | 26086075552526 |
10 | 6808564141611 |
11 | 219554aa60531 |
12 | 91b6664317a3 |
13 | 3a50776a178b |
14 | 19777170d911 |
15 | bc18e05d3c6 |
hex | 6313e0c0e2b |
6808564141611 has 8 divisors (see below), whose sum is σ = 9078479611344. Its totient is φ = 4538845716480.
The previous prime is 6808564141601. The next prime is 6808564141669. The reversal of 6808564141611 is 1161414658086.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 6808564141611 - 223 = 6808555753003 is a prime.
It is a super-2 number, since 2×68085641416112 (a number of 26 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (6808564141601) 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, 49180506 + ... + 49318751.
It is an arithmetic number, because the mean of its divisors is an integer number (1134809951418).
Almost surely, 26808564141611 is an apocalyptic number.
6808564141611 is a deficient number, since it is larger than the sum of its proper divisors (2269915469733).
6808564141611 is a wasteful number, since it uses less digits than its factorization.
6808564141611 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 98522301.
The product of its (nonzero) digits is 1105920, while the sum is 51.
Adding to 6808564141611 its reverse (1161414658086), we get a palindrome (7969978799697).
The spelling of 6808564141611 in words is "six trillion, eight hundred eight billion, five hundred sixty-four million, one hundred forty-one thousand, six hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •