Base | Representation |
---|---|
bin | 1010000000100100110101… |
… | …1110011111010011001111 |
3 | 1102222001211210102101121121 |
4 | 2200021031132133103033 |
5 | 2420301223022104021 |
6 | 35223344024341411 |
7 | 2214041211000634 |
oct | 240111536372317 |
9 | 42861753371547 |
10 | 11005006050511 |
11 | 3563219019840 |
12 | 1298a16314867 |
13 | 61a9c95c0915 |
14 | 2a090637018b |
15 | 1413eae08741 |
hex | a024d79f4cf |
11005006050511 has 16 divisors (see below), whose sum is σ = 12540019714560. Its totient is φ = 9565784212320.
The previous prime is 11005006050473. The next prime is 11005006050529. The reversal of 11005006050511 is 11505060050011.
It is a cyclic number.
It is not a de Polignac number, because 11005006050511 - 227 = 11004871832783 is a prime.
It is a super-2 number, since 2×110050060505112 (a number of 27 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 (11005006050011) 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 15 ways as a sum of consecutive naturals, for example, 167435355 + ... + 167501068.
It is an arithmetic number, because the mean of its divisors is an integer number (783751232160).
Almost surely, 211005006050511 is an apocalyptic number.
11005006050511 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11005006050511 is a deficient number, since it is larger than the sum of its proper divisors (1535013664049).
11005006050511 is a wasteful number, since it uses less digits than its factorization.
11005006050511 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 334936566.
The product of its (nonzero) digits is 750, while the sum is 25.
The spelling of 11005006050511 in words is "eleven trillion, five billion, six million, fifty thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •