Search a number
-
+
30002301010709 is a prime number
BaseRepresentation
bin1101101001001011101000…
…11111101000001100010101
310221020012011221110012202222
412310211310133220030111
512413024203024320314
6143450511121512125
76214410662560226
oct664456437501425
9127205157405688
1030002301010709
1196179a48424a5
123446791aa2645
131398288079451
1475a194bdd24d
15370666ce9c8e
hex1b49747e8315

30002301010709 has 2 divisors, whose sum is σ = 30002301010710. Its totient is φ = 30002301010708.

The previous prime is 30002301010679. The next prime is 30002301010729. The reversal of 30002301010709 is 90701010320003.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 27431720500900 + 2570580509809 = 5237530^2 + 1603303^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-30002301010709 is a prime.

It is a congruent number.

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

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

Almost surely, 230002301010709 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 30002301010709 in words is "thirty trillion, two billion, three hundred one million, ten thousand, seven hundred nine".