Search a number
-
+
13101310203019 is a prime number
BaseRepresentation
bin1011111010100110001011…
…1100001101010010001011
31201101110202211112002011221
42332221202330031102023
53204122440402444034
643510354145502511
72521352452203643
oct276514274152213
951343684462157
1013101310203019
1141a1264071805
121577156341a37
137405a9a65bcc
1433416d0a1523
1517abdd929bb4
hexbea62f0d48b

13101310203019 has 2 divisors, whose sum is σ = 13101310203020. Its totient is φ = 13101310203018.

The previous prime is 13101310202993. The next prime is 13101310203029. The reversal of 13101310203019 is 91030201310131.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 13101310203019 - 237 = 12963871249547 is a prime.

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

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

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

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

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

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

Almost surely, 213101310203019 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 486, while the sum is 25.

The spelling of 13101310203019 in words is "thirteen trillion, one hundred one billion, three hundred ten million, two hundred three thousand, nineteen".