Search a number
-
+
1312000101791 is a prime number
BaseRepresentation
bin10011000101111001010…
…011001100110110011111
311122102111112122210012122
4103011321103030312133
5132443434011224131
62442420255253155
7163534404601031
oct23057123146637
94572445583178
101312000101791
11466463943295
1219233621a1bb
139694b2963a2
14477031d1c51
15241dc6b5d7b
hex131794ccd9f

1312000101791 has 2 divisors, whose sum is σ = 1312000101792. Its totient is φ = 1312000101790.

The previous prime is 1312000101787. The next prime is 1312000101793. The reversal of 1312000101791 is 1971010002131.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 1312000101791 - 22 = 1312000101787 is a prime.

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

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

It is a Chen prime.

It is a self number, because there is not a number n which added to its sum of digits gives 1312000101791.

It is a congruent number.

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

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

Almost surely, 21312000101791 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 378, while the sum is 26.

The spelling of 1312000101791 in words is "one trillion, three hundred twelve billion, one hundred one thousand, seven hundred ninety-one".