Search a number
-
+
1313020231123 is a prime number
BaseRepresentation
bin10011000110110110000…
…110101011110111010011
311122112010122012201120111
4103012312012223313103
5133003031134343443
62443105420222151
7163601602550026
oct23066606536723
94575118181514
101313020231123
11466937765587
1219257b99a957
1396a81730803
144779c89d1bd
152424c02169d
hex131b61abdd3

1313020231123 has 2 divisors, whose sum is σ = 1313020231124. Its totient is φ = 1313020231122.

The previous prime is 1313020231121. The next prime is 1313020231129. The reversal of 1313020231123 is 3211320203131.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 1313020231123 - 21 = 1313020231121 is a prime.

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

Together with 1313020231121, it forms a pair of twin primes.

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

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

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

Almost surely, 21313020231123 is an apocalyptic number.

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

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

1313020231123 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 22.

Adding to 1313020231123 its reverse (3211320203131), we get a palindrome (4524340434254).

The spelling of 1313020231123 in words is "one trillion, three hundred thirteen billion, twenty million, two hundred thirty-one thousand, one hundred twenty-three".