Search a number
-
+
13110112101269 is a prime number
BaseRepresentation
bin1011111011000110111110…
…0100110010001110010101
31201102022111020211211200102
42332301233210302032111
53204244002144220034
643514411413023445
72522113541124611
oct276615744621625
951368436754612
1013110112101269
1141a4a70557187
1215789b2024b85
13741380474c21
1433476606a341
1517b05652497e
hexbec6f932395

13110112101269 has 2 divisors, whose sum is σ = 13110112101270. Its totient is φ = 13110112101268.

The previous prime is 13110112101223. The next prime is 13110112101337. The reversal of 13110112101269 is 96210121101131.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 8489705964100 + 4620406137169 = 2913710^2 + 2149513^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-13110112101269 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 213110112101269 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 648, while the sum is 29.

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