Base | Representation |
---|---|
bin | 11111100000011111100… |
… | …00010000110011100001 |
3 | 10211111100222111110002001 |
4 | 33300033300100303201 |
5 | 120214124043143302 |
6 | 2145200542524001 |
7 | 141133511515462 |
oct | 17601760206341 |
9 | 3744328443061 |
10 | 1082596068577 |
11 | 3881432917a1 |
12 | 155993296601 |
13 | 7b11c1c7cba |
14 | 3a57dcbcd69 |
15 | 1d262ada787 |
hex | fc0fc10ce1 |
1082596068577 has 16 divisors (see below), whose sum is σ = 1150052824080. Its totient is φ = 1015562944512.
The previous prime is 1082596068557. The next prime is 1082596068583. The reversal of 1082596068577 is 7758606952801.
It can be written as a sum of positive squares in 8 ways, for example, as 266544005841 + 816052062736 = 516279^2 + 903356^2 .
It is a de Polignac number, because none of the positive numbers 2k-1082596068577 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1082596068517) 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 15 ways as a sum of consecutive naturals, for example, 8229673 + ... + 8360185.
It is an arithmetic number, because the mean of its divisors is an integer number (71878301505).
Almost surely, 21082596068577 is an apocalyptic number.
1082596068577 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
It is an amenable number.
1082596068577 is a deficient number, since it is larger than the sum of its proper divisors (67456755503).
1082596068577 is a wasteful number, since it uses less digits than its factorization.
1082596068577 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 132132.
The product of its (nonzero) digits is 50803200, while the sum is 64.
The spelling of 1082596068577 in words is "one trillion, eighty-two billion, five hundred ninety-six million, sixty-eight thousand, five hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •