Search a number
BaseRepresentation
bin10100101100100010…
…01000111100001101
31001200100022210102011
422112101020330031
5140223404310221
65034311301221
7542225012224
oct122621107415
931610283364
1011111010061
11479196a348
1221a107a811
131080c24688
14775929cbb
154506bb1e1
hex296448f0d

11111010061 has 2 divisors, whose sum is σ = 11111010062. Its totient is φ = 11111010060.

The previous prime is 11111010037. The next prime is 11111010067. The reversal of 11111010061 is 16001011111.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 11110424836 + 585225 = 105406^2 + 765^2 .

It is a cyclic number.

It is not a de Polignac number, because 11111010061 - 27 = 11111009933 is a prime.

It is a congruent number.

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

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

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

Almost surely, 211111010061 is an apocalyptic number.

It is an amenable number.

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

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

11111010061 is an odious number, because the sum of its binary digits is odd.

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

Adding to 11111010061 its reverse (16001011111), we get a palindrome (27112021172).

The spelling of 11111010061 in words is "eleven billion, one hundred eleven million, ten thousand, sixty-one".