Base | Representation |
---|---|
bin | 101001111111… |
… | …000010011001 |
3 | 202201011112112 |
4 | 221333002121 |
5 | 10304143410 |
6 | 1031522105 |
7 | 162356525 |
oct | 51770231 |
9 | 22634475 |
10 | 11006105 |
11 | 6238060 |
12 | 3829335 |
13 | 23847b6 |
14 | 1666d85 |
15 | e76105 |
hex | a7f099 |
11006105 has 16 divisors (see below), whose sum is σ = 14563584. Its totient is φ = 7918080.
The previous prime is 11006101. The next prime is 11006119. The reversal of 11006105 is 50160011.
It is not a de Polignac number, because 11006105 - 22 = 11006101 is a prime.
It is a super-2 number, since 2×110061052 = 242268694542050, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11006105.
It is not an unprimeable number, because it can be changed into a prime (11006101) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 4304 + ... + 6366.
It is an arithmetic number, because the mean of its divisors is an integer number (910224).
Almost surely, 211006105 is an apocalyptic number.
It is an amenable number.
11006105 is a deficient number, since it is larger than the sum of its proper divisors (3557479).
11006105 is a wasteful number, since it uses less digits than its factorization.
11006105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2176.
The product of its (nonzero) digits is 30, while the sum is 14.
The square root of 11006105 is about 3317.5450260697. The cubic root of 11006105 is about 222.4391450794.
Adding to 11006105 its reverse (50160011), we get a palindrome (61166116).
It can be divided in two parts, 11006 and 105, that added together give a palindrome (11111).
The spelling of 11006105 in words is "eleven million, six thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •