Base | Representation |
---|---|
bin | 10100100101111011… |
… | …00101000000101111 |
3 | 1001112110222011012202 |
4 | 22102331211000233 |
5 | 140120210104021 |
6 | 5025010452115 |
7 | 540652425455 |
oct | 122275450057 |
9 | 31473864182 |
10 | 11055550511 |
11 | 476362a805 |
12 | 218659403b |
13 | 10725a7285 |
14 | 76c4109d5 |
15 | 44a8b3a0b |
hex | 292f6502f |
11055550511 has 2 divisors, whose sum is σ = 11055550512. Its totient is φ = 11055550510.
The previous prime is 11055550447. The next prime is 11055550537. The reversal of 11055550511 is 11505555011.
It is a happy number.
11055550511 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 11055550511 - 26 = 11055550447 is a prime.
It is a super-2 number, since 2×110555505112 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11055550591) 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 as a sum of consecutive naturals, namely, 5527775255 + 5527775256.
It is an arithmetic number, because the mean of its divisors is an integer number (5527775256).
Almost surely, 211055550511 is an apocalyptic number.
11055550511 is a deficient number, since it is larger than the sum of its proper divisors (1).
11055550511 is an equidigital number, since it uses as much as digits as its factorization.
11055550511 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 29.
The spelling of 11055550511 in words is "eleven billion, fifty-five million, five hundred fifty thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.032 sec. • engine limits •