Base | Representation |
---|---|
bin | 10000010000010010000… |
… | …001010111100101110001 |
3 | 10221210011012222120102021 |
4 | 100100102001113211301 |
5 | 121300100411024432 |
6 | 2213050114351441 |
7 | 143462102013646 |
oct | 20202201274561 |
9 | 3853135876367 |
10 | 1116993845617 |
11 | 3a07949a6801 |
12 | 160592b8b581 |
13 | 81441725320 |
14 | 3c0c4423dcd |
15 | 1e0c785e697 |
hex | 10412057971 |
1116993845617 has 8 divisors (see below), whose sum is σ = 1202949976424. Its totient is φ = 1031042504448.
The previous prime is 1116993845609. The next prime is 1116993845701. The reversal of 1116993845617 is 7165483996111.
It can be written as a sum of positive squares in 4 ways, for example, as 289410644961 + 827583200656 = 537969^2 + 909716^2 .
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 1116993845617 - 23 = 1116993845609 is a prime.
It is a super-2 number, since 2×11169938456172 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1116993845017) 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, 705558 + ... + 1652815.
It is an arithmetic number, because the mean of its divisors is an integer number (150368747053).
Almost surely, 21116993845617 is an apocalyptic number.
It is an amenable number.
1116993845617 is a deficient number, since it is larger than the sum of its proper divisors (85956130807).
1116993845617 is a wasteful number, since it uses less digits than its factorization.
1116993845617 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2394819.
The product of its digits is 9797760, while the sum is 61.
The spelling of 1116993845617 in words is "one trillion, one hundred sixteen billion, nine hundred ninety-three million, eight hundred forty-five thousand, six hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •