Base | Representation |
---|---|
bin | 10100011111111101… |
… | …01101100110000001 |
3 | 1001101222211010222200 |
4 | 22033332231212001 |
5 | 140014403004121 |
6 | 5020022223413 |
7 | 536504225643 |
oct | 121776554601 |
9 | 31358733880 |
10 | 11005516161 |
11 | 4738366202 |
12 | 2171884b69 |
13 | 1065109353 |
14 | 765908893 |
15 | 4462cda26 |
hex | 28ffad981 |
11005516161 has 12 divisors (see below), whose sum is σ = 15897794640. Its totient is φ = 7336577880.
The previous prime is 11005516139. The next prime is 11005516177. The reversal of 11005516161 is 16161550011.
11005516161 is a `hidden beast` number, since 1 + 100 + 551 + 6 + 1 + 6 + 1 = 666.
It is not a de Polignac number, because 11005516161 - 29 = 11005515649 is a prime.
It is a super-2 number, since 2×110055161612 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (11005516111) 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 11 ways as a sum of consecutive naturals, for example, 222430 + ... + 267368.
It is an arithmetic number, because the mean of its divisors is an integer number (1324816220).
Almost surely, 211005516161 is an apocalyptic number.
It is an amenable number.
11005516161 is a deficient number, since it is larger than the sum of its proper divisors (4892278479).
11005516161 is a wasteful number, since it uses less digits than its factorization.
11005516161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 72156 (or 72153 counting only the distinct ones).
The product of its (nonzero) digits is 900, while the sum is 27.
The spelling of 11005516161 in words is "eleven billion, five million, five hundred sixteen thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •