Base | Representation |
---|---|
bin | 10100110010110111… |
… | …10010001010100101 |
3 | 1001211001021200000120 |
4 | 22121123302022211 |
5 | 140331004211010 |
6 | 5043450032153 |
7 | 543441361545 |
oct | 123133621245 |
9 | 31731250016 |
10 | 11164132005 |
11 | 4809952684 |
12 | 21b6a18659 |
13 | 108bc33a90 |
14 | 77c9d7325 |
15 | 4551b0e70 |
hex | 2996f22a5 |
11164132005 has 64 divisors (see below), whose sum is σ = 20275664640. Its totient is φ = 5200091136.
The previous prime is 11164132003. The next prime is 11164132009. The reversal of 11164132005 is 50023146111.
It is a happy number.
11164132005 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 11164132005 - 21 = 11164132003 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11164132003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 3825807 + ... + 3828723.
It is an arithmetic number, because the mean of its divisors is an integer number (316807260).
Almost surely, 211164132005 is an apocalyptic number.
11164132005 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
11164132005 is a deficient number, since it is larger than the sum of its proper divisors (9111532635).
11164132005 is a wasteful number, since it uses less digits than its factorization.
11164132005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3990.
The product of its (nonzero) digits is 720, while the sum is 24.
Adding to 11164132005 its reverse (50023146111), we get a palindrome (61187278116).
The spelling of 11164132005 in words is "eleven billion, one hundred sixty-four million, one hundred thirty-two thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •