Base | Representation |
---|---|
bin | 1010000000100110111001… |
… | …0000100101111001001011 |
3 | 1102222010021010100112210110 |
4 | 2200021232100211321023 |
5 | 2420303334322240002 |
6 | 35223514353045403 |
7 | 2214060636653250 |
oct | 240115620457113 |
9 | 42863233315713 |
10 | 11005556055627 |
11 | 356348052a821 |
12 | 1298b4a556863 |
13 | 61aa86533533 |
14 | 2a0959421427 |
15 | 14142e34ce6c |
hex | a026e425e4b |
11005556055627 has 96 divisors (see below), whose sum is σ = 18465516085248. Its totient is φ = 5706546430464.
The previous prime is 11005556055607. The next prime is 11005556055667. The reversal of 11005556055627 is 72655065550011.
It is not a de Polignac number, because 11005556055627 - 27 = 11005556055499 is a prime.
It is a super-2 number, since 2×110055560556272 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (11005556055607) 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 95 ways as a sum of consecutive naturals, for example, 18823348 + ... + 19399214.
It is an arithmetic number, because the mean of its divisors is an integer number (192349125888).
Almost surely, 211005556055627 is an apocalyptic number.
11005556055627 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
11005556055627 is a deficient number, since it is larger than the sum of its proper divisors (7459960029621).
11005556055627 is a wasteful number, since it uses less digits than its factorization.
11005556055627 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 576025 (or 576008 counting only the distinct ones).
The product of its (nonzero) digits is 1575000, while the sum is 48.
The spelling of 11005556055627 in words is "eleven trillion, five billion, five hundred fifty-six million, fifty-five thousand, six hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •