Base | Representation |
---|---|
bin | 1010000011011001101110… |
… | …0100001000011000100001 |
3 | 1110010201011122201212010000 |
4 | 2200312123210020120201 |
5 | 2422100143030330414 |
6 | 35301534041130213 |
7 | 2220410353333536 |
oct | 240663344103041 |
9 | 43121148655100 |
10 | 11053560792609 |
11 | 35818749a1175 |
12 | 12a6307189969 |
13 | 622466ac704a |
14 | 2a2dd0b6ad8d |
15 | 1427dd968b09 |
hex | a0d9b908621 |
11053560792609 has 20 divisors (see below), whose sum is σ = 16597664326276. Its totient is φ = 7330858960896.
The previous prime is 11053560792601. The next prime is 11053560792623. The reversal of 11053560792609 is 90629706535011.
11053560792609 is a `hidden beast` number, since 1 + 1 + 0 + 5 + 3 + 5 + 607 + 9 + 26 + 0 + 9 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 6391653661584 + 4661907131025 = 2528172^2 + 2159145^2 .
It is not a de Polignac number, because 11053560792609 - 23 = 11053560792601 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11053560792601) 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 19 ways as a sum of consecutive naturals, for example, 353517304 + ... + 353548569.
Almost surely, 211053560792609 is an apocalyptic number.
It is an amenable number.
11053560792609 is a deficient number, since it is larger than the sum of its proper divisors (5544103533667).
11053560792609 is an equidigital number, since it uses as much as digits as its factorization.
11053560792609 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 707066078 (or 707066069 counting only the distinct ones).
The product of its (nonzero) digits is 3061800, while the sum is 54.
The spelling of 11053560792609 in words is "eleven trillion, fifty-three billion, five hundred sixty million, seven hundred ninety-two thousand, six hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •