Search a number
-
+
10313013110209 is a prime number
BaseRepresentation
bin1001011000010010111101…
…1110111010010111000001
31100111220200121121202212021
42112010233132322113001
52322432022324011314
633533422142201441
72113043036026525
oct226045736722701
940456617552767
1010313013110209
1133167a704a657
1211a6893283281
1359a688c99234
1427921c64dd85
1512d3e9c93324
hex9612f7ba5c1

10313013110209 has 2 divisors, whose sum is σ = 10313013110210. Its totient is φ = 10313013110208.

The previous prime is 10313013110189. The next prime is 10313013110233. The reversal of 10313013110209 is 90201131031301.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 5164924386609 + 5148088723600 = 2272647^2 + 2268940^2 .

It is a cyclic number.

It is not a de Polignac number, because 10313013110209 - 213 = 10313013102017 is a prime.

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

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

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

Almost surely, 210313013110209 is an apocalyptic number.

It is an amenable number.

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

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

10313013110209 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 10313013110209 in words is "ten trillion, three hundred thirteen billion, thirteen million, one hundred ten thousand, two hundred nine".