Search a number
BaseRepresentation
bin10100100000101000…
…00011100010001011
31001102101100101201211
422100110003202023
5140022321023201
65020342153551
7536602620403
oct122024034213
931371311654
1011011111051
114740537786
1221737228b7
131066317b35
14766563803
15446a36651
hex29050388b

11011111051 has 2 divisors, whose sum is σ = 11011111052. Its totient is φ = 11011111050.

The previous prime is 11011111049. The next prime is 11011111117. The reversal of 11011111051 is 15011111011.

Adding to 11011111051 its reverse (15011111011), we get a palindrome (26022222062).

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 11011111051 - 21 = 11011111049 is a prime.

Together with 11011111049, it forms a pair of twin primes.

It is not a weakly prime, because it can be changed into another prime (11011111031) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5505555525 + 5505555526.

It is an arithmetic number, because the mean of its divisors is an integer number (5505555526).

Almost surely, 211011111051 is an apocalyptic number.

11011111051 is a deficient number, since it is larger than the sum of its proper divisors (1).

11011111051 is an equidigital number, since it uses as much as digits as its factorization.

11011111051 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 5, while the sum is 13.

The spelling of 11011111051 in words is "eleven billion, eleven million, one hundred eleven thousand, fifty-one".