Base | Representation |
---|---|
bin | 10100100101111110… |
… | …10011111111110101 |
3 | 1001112111211020210201 |
4 | 22102333103333311 |
5 | 140120314130414 |
6 | 5025024320501 |
7 | 540656331022 |
oct | 122277237765 |
9 | 31474736721 |
10 | 11056005109 |
11 | 4763910306 |
12 | 2186773131 |
13 | 1072706176 |
14 | 76c4cc549 |
15 | 44a953574 |
hex | 292fd3ff5 |
11056005109 has 4 divisors (see below), whose sum is σ = 11063522560. Its totient is φ = 11048487660.
The previous prime is 11056005091. The next prime is 11056005161. The reversal of 11056005109 is 90150065011.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 11056005109 - 227 = 10921787381 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11056005809) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3756519 + ... + 3759460.
It is an arithmetic number, because the mean of its divisors is an integer number (2765880640).
Almost surely, 211056005109 is an apocalyptic number.
It is an amenable number.
11056005109 is a deficient number, since it is larger than the sum of its proper divisors (7517451).
11056005109 is an equidigital number, since it uses as much as digits as its factorization.
11056005109 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7517450.
The product of its (nonzero) digits is 1350, while the sum is 28.
The spelling of 11056005109 in words is "eleven billion, fifty-six million, five thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •