Base | Representation |
---|---|
bin | 10100100000000110… |
… | …11001101001100001 |
3 | 1001102002010120220002 |
4 | 22100003121221201 |
5 | 140020211321220 |
6 | 5020104425345 |
7 | 536520535052 |
oct | 122003315141 |
9 | 31362116802 |
10 | 11006745185 |
11 | 4739025627 |
12 | 2172178255 |
13 | 1065449897 |
14 | 765b48729 |
15 | 446472c75 |
hex | 2900d9a61 |
11006745185 has 4 divisors (see below), whose sum is σ = 13208094228. Its totient is φ = 8805396144.
The previous prime is 11006745179. The next prime is 11006745229. The reversal of 11006745185 is 58154760011.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 58154760011 = 151 ⋅385130861.
It can be written as a sum of positive squares in 2 ways, for example, as 6266147281 + 4740597904 = 79159^2 + 68852^2 .
It is a cyclic number.
It is not a de Polignac number, because 11006745185 - 28 = 11006744929 is a prime.
It is a super-2 number, since 2×110067451852 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1100674514 + ... + 1100674523.
It is an arithmetic number, because the mean of its divisors is an integer number (3302023557).
Almost surely, 211006745185 is an apocalyptic number.
It is an amenable number.
11006745185 is a deficient number, since it is larger than the sum of its proper divisors (2201349043).
11006745185 is an equidigital number, since it uses as much as digits as its factorization.
11006745185 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2201349042.
The product of its (nonzero) digits is 33600, while the sum is 38.
The spelling of 11006745185 in words is "eleven billion, six million, seven hundred forty-five thousand, one hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •