Base | Representation |
---|---|
bin | 10100110000000011… |
… | …10110011001110111 |
3 | 1001202101220220101021 |
4 | 22120001312121313 |
5 | 140303440301112 |
6 | 5041244442011 |
7 | 543034111201 |
oct | 123001663167 |
9 | 31671826337 |
10 | 11140556407 |
11 | 47a760aa12 |
12 | 21aab49307 |
13 | 108709b016 |
14 | 77981b771 |
15 | 4530a5907 |
hex | 298076677 |
11140556407 has 4 divisors (see below), whose sum is σ = 11189633976. Its totient is φ = 11091478840.
The previous prime is 11140556359. The next prime is 11140556417. The reversal of 11140556407 is 70465504111.
11140556407 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 11140556407 - 27 = 11140556279 is a prime.
It is a super-2 number, since 2×111405564072 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11140556417) 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 3 ways as a sum of consecutive naturals, for example, 24538444 + ... + 24538897.
It is an arithmetic number, because the mean of its divisors is an integer number (2797408494).
Almost surely, 211140556407 is an apocalyptic number.
11140556407 is a deficient number, since it is larger than the sum of its proper divisors (49077569).
11140556407 is an equidigital number, since it uses as much as digits as its factorization.
11140556407 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49077568.
The product of its (nonzero) digits is 16800, while the sum is 34.
The spelling of 11140556407 in words is "eleven billion, one hundred forty million, five hundred fifty-six thousand, four hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •