Search a number
-
+
13110110413469 is a prime number
BaseRepresentation
bin1011111011000110111101…
…1110010110001010011101
31201102022111010200002110022
42332301233132112022131
53204244001231212334
643514411312521525
72522113520565116
oct276615736261235
951368433602408
1013110110413469
1141a4a6a604103
1215789b15502a5
13741380003924
14334765b4b20d
1517b0562de82e
hexbec6f79629d

13110110413469 has 2 divisors, whose sum is σ = 13110110413470. Its totient is φ = 13110110413468.

The previous prime is 13110110413441. The next prime is 13110110413487. The reversal of 13110110413469 is 96431401101131.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 10011940147225 + 3098170266244 = 3164165^2 + 1760162^2 .

It is a cyclic number.

It is not a de Polignac number, because 13110110413469 - 224 = 13110093636253 is a prime.

It is a super-2 number, since 2×131101104134692 (a number of 27 digits) contains 22 as substring.

It is a Sophie Germain prime.

It is a Curzon number.

It is a congruent number.

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

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

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

Almost surely, 213110110413469 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 7776, while the sum is 35.

The spelling of 13110110413469 in words is "thirteen trillion, one hundred ten billion, one hundred ten million, four hundred thirteen thousand, four hundred sixty-nine".