Search a number
-
+
107080300631 is a prime number
BaseRepresentation
bin110001110111001111…
…0111011100001010111
3101020101121110212210102
41203232132323201113
53223300024110011
6121105250244315
710510356352253
oct1435636734127
9336347425712
10107080300631
114145a046827
1218904b8669b
13a13664c845
14527b521263
152bbab1673b
hex18ee7bb857

107080300631 has 2 divisors, whose sum is σ = 107080300632. Its totient is φ = 107080300630.

The previous prime is 107080300627. The next prime is 107080300633. The reversal of 107080300631 is 136003080701.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 107080300631 - 22 = 107080300627 is a prime.

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

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

It is a Chen prime.

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

It is a congruent number.

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

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

Almost surely, 2107080300631 is an apocalyptic number.

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

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

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

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

The spelling of 107080300631 in words is "one hundred seven billion, eighty million, three hundred thousand, six hundred thirty-one".