Search a number
-
+
11111111109929 is a prime number
BaseRepresentation
bin1010000110110000000111…
…0101001010110100101001
31110100012201102210212222002
42201230001311022310221
52424021023421004204
635344212440140345
72224515456061325
oct241540165126451
943305642725862
1011111111109929
1135a4217612396
1212b54a87676b5
13627a08b9174c
142a5ad014a985
1514405b0ce91e
hexa1b01d4ad29

11111111109929 has 2 divisors, whose sum is σ = 11111111109930. Its totient is φ = 11111111109928.

The previous prime is 11111111109911. The next prime is 11111111109949. The reversal of 11111111109929 is 92990111111111.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 11107902453904 + 3208656025 = 3332852^2 + 56645^2 .

It is a cyclic number.

It is not a de Polignac number, because 11111111109929 - 232 = 11106816142633 is a prime.

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

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

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

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

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

Almost surely, 211111111109929 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1458, while the sum is 38.

The spelling of 11111111109929 in words is "eleven trillion, one hundred eleven billion, one hundred eleven million, one hundred nine thousand, nine hundred twenty-nine".