Base | Representation |
---|---|
bin | 1010000011010010000011… |
… | …0110111100010000100001 |
3 | 1110010111212011222202120202 |
4 | 2200310200312330100201 |
5 | 2422031434021013423 |
6 | 35300553500514545 |
7 | 2220305345060441 |
oct | 240644066742041 |
9 | 43114764882522 |
10 | 11051502126113 |
11 | 3580a089245a9 |
12 | 12a5a3184ba55 |
13 | 6221c944b9a7 |
14 | 2a2c775a0121 |
15 | 14271cd68728 |
hex | a0d20dbc421 |
11051502126113 has 4 divisors (see below), whose sum is σ = 11057408863488. Its totient is φ = 11045595388740.
The previous prime is 11051502126107. The next prime is 11051502126121. The reversal of 11051502126113 is 31162120515011.
It is a happy number.
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 11051502126113 - 234 = 11034322256929 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11051502126163) 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, 2953365881 + ... + 2953369622.
It is an arithmetic number, because the mean of its divisors is an integer number (2764352215872).
Almost surely, 211051502126113 is an apocalyptic number.
It is an amenable number.
11051502126113 is a deficient number, since it is larger than the sum of its proper divisors (5906737375).
11051502126113 is an equidigital number, since it uses as much as digits as its factorization.
11051502126113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5906737374.
The product of its (nonzero) digits is 1800, while the sum is 29.
The spelling of 11051502126113 in words is "eleven trillion, fifty-one billion, five hundred two million, one hundred twenty-six thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •