Search a number
-
+
130303099709 is a prime number
BaseRepresentation
bin111100101011010101…
…0111000001100111101
3110110100001021022020222
41321112222320030331
54113330043142314
6135505503351125
712262014033656
oct1712652701475
9413301238228
10130303099709
1150296780462
12213062b24a5
13c397919483
14644184852d
1535c9785c8e
hex1e56ab833d

130303099709 has 2 divisors, whose sum is σ = 130303099710. Its totient is φ = 130303099708.

The previous prime is 130303099691. The next prime is 130303099711. The reversal of 130303099709 is 907990303031.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 67501236100 + 62801863609 = 259810^2 + 250603^2 .

It is a cyclic number.

It is not a de Polignac number, because 130303099709 - 212 = 130303095613 is a prime.

It is a Sophie Germain prime.

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

It is a Chen prime.

It is a Curzon number.

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

It is a congruent number.

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

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

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

Almost surely, 2130303099709 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 137781, while the sum is 44.

The spelling of 130303099709 in words is "one hundred thirty billion, three hundred three million, ninety-nine thousand, seven hundred nine".