Search a number
-
+
1111111100513 is a prime number
BaseRepresentation
bin10000001010110011011…
…000011110100001100001
310221012222020120011012222
4100022303120132201201
5121201023420204023
62210234251000425
7143163240344411
oct20126330364141
93835866504188
101111111100513
11399246282297
1215b410a39115
1380a14a31b6b
143bac7018641
151dd81188cc8
hex102b361e861

1111111100513 has 2 divisors, whose sum is σ = 1111111100514. Its totient is φ = 1111111100512.

The previous prime is 1111111100501. The next prime is 1111111100537. The reversal of 1111111100513 is 3150011111111.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 615302185744 + 495808914769 = 784412^2 + 704137^2 .

It is a cyclic number.

It is not a de Polignac number, because 1111111100513 - 28 = 1111111100257 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 1111111100491 and 1111111100500.

It is not a weakly prime, because it can be changed into another prime (1111111100563) 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, 555555550256 + 555555550257.

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

Almost surely, 21111111100513 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 15, while the sum is 17.

Adding to 1111111100513 its reverse (3150011111111), we get a palindrome (4261122211624).

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