Base | Representation |
---|---|
bin | 1010000000100111010011… |
… | …0100101000011011101001 |
3 | 1102222010112210112202112010 |
4 | 2200021310310220123221 |
5 | 2420304101014312010 |
6 | 35223533325110133 |
7 | 2214063444616233 |
oct | 240116464503351 |
9 | 42863483482463 |
10 | 11005666166505 |
11 | 35635276a774a |
12 | 1298b7b3b8349 |
13 | 61aaa32a71ba |
14 | 2a0969cc5253 |
15 | 141438d4d620 |
hex | a0274d286e9 |
11005666166505 has 16 divisors (see below), whose sum is σ = 17609517406080. Its totient is φ = 5869538108928.
The previous prime is 11005666166501. The next prime is 11005666166543. The reversal of 11005666166505 is 50566166650011.
It is not a de Polignac number, because 11005666166505 - 22 = 11005666166501 is a prime.
It is a super-2 number, since 2×110056661665052 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (11005666166501) 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, 8801352 + ... + 9973721.
It is an arithmetic number, because the mean of its divisors is an integer number (1100594837880).
Almost surely, 211005666166505 is an apocalyptic number.
11005666166505 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
11005666166505 is a deficient number, since it is larger than the sum of its proper divisors (6603851239575).
11005666166505 is a wasteful number, since it uses less digits than its factorization.
11005666166505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18814160.
The product of its (nonzero) digits is 972000, while the sum is 48.
The spelling of 11005666166505 in words is "eleven trillion, five billion, six hundred sixty-six million, one hundred sixty-six thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •