Search a number
-
+
30001320001099 is a prime number
BaseRepresentation
bin1101101001001001110100…
…00001010111111001001011
310221020002122120111202120201
412310210322001113321023
512413020200410013344
6143450225515233031
76214344451252006
oct664447201277113
9127202576452521
1030001320001099
11961754100a457
123446559448777
13139815ca5aca5
1475a1007d653d
1537060ab1a4d4
hex1b493a057e4b

30001320001099 has 2 divisors, whose sum is σ = 30001320001100. Its totient is φ = 30001320001098.

The previous prime is 30001320001031. The next prime is 30001320001127. The reversal of 30001320001099 is 99010002310003.

It is an a-pointer prime, because the next prime (30001320001127) can be obtained adding 30001320001099 to its sum of digits (28).

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 30001320001099 - 231 = 29999172517451 is a prime.

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

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

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

Almost surely, 230001320001099 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 1458, while the sum is 28.

The spelling of 30001320001099 in words is "thirty trillion, one billion, three hundred twenty million, one thousand, ninety-nine".