Base | Representation |
---|---|
bin | 101100100000000000001… |
… | …1010000100011110111011 |
3 | 210122200120100202201020101 |
4 | 1121000000122010132323 |
5 | 1300201122301413421 |
6 | 21001400424340231 |
7 | 1200604115323465 |
oct | 131000032043673 |
9 | 23580510681211 |
10 | 6116040263611 |
11 | 1a48886313a63 |
12 | 8293b5614677 |
13 | 354981082285 |
14 | 1720372a3135 |
15 | a915b4bd191 |
hex | 590006847bb |
6116040263611 has 16 divisors (see below), whose sum is σ = 6314678615520. Its totient is φ = 5919170584320.
The previous prime is 6116040263561. The next prime is 6116040263623. The reversal of 6116040263611 is 1163620406116.
It is a de Polignac number, because none of the positive numbers 2k-6116040263611 is a prime.
It is a super-2 number, since 2×61160402636112 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (37).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (6116040263111) 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 15 ways as a sum of consecutive naturals, for example, 32275980 + ... + 32464918.
It is an arithmetic number, because the mean of its divisors is an integer number (394667413470).
Almost surely, 26116040263611 is an apocalyptic number.
6116040263611 is a deficient number, since it is larger than the sum of its proper divisors (198638351909).
6116040263611 is a wasteful number, since it uses less digits than its factorization.
6116040263611 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 193614.
The product of its (nonzero) digits is 31104, while the sum is 37.
Adding to 6116040263611 its reverse (1163620406116), we get a palindrome (7279660669727).
The spelling of 6116040263611 in words is "six trillion, one hundred sixteen billion, forty million, two hundred sixty-three thousand, six hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •