Base | Representation |
---|---|
bin | 1010000000100100110101… |
… | …1100100101000111100011 |
3 | 1102222001211202110222010001 |
4 | 2200021031130211013203 |
5 | 2420301222410100201 |
6 | 35223344005520431 |
7 | 2214041203514602 |
oct | 240111534450743 |
9 | 42861752428101 |
10 | 11005005550051 |
11 | 3563218807837 |
12 | 1298a16113117 |
13 | 61a9c9476ba6 |
14 | 2a090627da39 |
15 | 1413ead5a301 |
hex | a024d7251e3 |
11005005550051 has 2 divisors, whose sum is σ = 11005005550052. Its totient is φ = 11005005550050.
The previous prime is 11005005550043. The next prime is 11005005550057. The reversal of 11005005550051 is 15005550050011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 11005005550051 - 23 = 11005005550043 is a prime.
It is a super-2 number, since 2×110050055500512 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11005005550057) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5502502775025 + 5502502775026.
It is an arithmetic number, because the mean of its divisors is an integer number (5502502775026).
Almost surely, 211005005550051 is an apocalyptic number.
11005005550051 is a deficient number, since it is larger than the sum of its proper divisors (1).
11005005550051 is an equidigital number, since it uses as much as digits as its factorization.
11005005550051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3125, while the sum is 28.
The spelling of 11005005550051 in words is "eleven trillion, five billion, five million, five hundred fifty thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.147 sec. • engine limits •