Search a number
-
+
11111060513 = 72613717317
BaseRepresentation
bin10100101100100010…
…10101010000100001
31001200100102100121202
422112101111100201
5140223412414023
65034312330545
7542225312300
oct122621252041
931610370552
1011111060513
1147919a4243
1221a10a3a55
131080c41627
14775940437
154506cb128
hex296455421

11111060513 has 12 divisors (see below), whose sum is σ = 13137001812. Its totient is φ = 9367636320.

The previous prime is 11111060489. The next prime is 11111060531. The reversal of 11111060513 is 31506011111.

It can be written as a sum of positive squares in 2 ways, for example, as 4333325584 + 6777734929 = 65828^2 + 82327^2 .

It is not a de Polignac number, because 11111060513 - 26 = 11111060449 is a prime.

It is a Duffinian number.

It is a Curzon number.

It is not an unprimeable number, because it can be changed into a prime (11111060533) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1855670 + ... + 1861647.

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

Almost surely, 211111060513 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 3717392 (or 3717385 counting only the distinct ones).

The product of its (nonzero) digits is 90, while the sum is 20.

Adding to 11111060513 its reverse (31506011111), we get a palindrome (42617071624).

The spelling of 11111060513 in words is "eleven billion, one hundred eleven million, sixty thousand, five hundred thirteen".

Divisors: 1 7 49 61 427 2989 3717317 26021219 182148533 226756337 1587294359 11111060513