Search a number
-
+
30001132101169 is a prime number
BaseRepresentation
bin1101101001001001011101…
…10100100101111000110001
310221020002011110221110100001
412310210232310211320301
512413014304304214134
6143450155124030001
76214340010161545
oct664445664457061
9127202143843301
1030001132101169
119617454a41459
123446506532301
13139812cb4c3b8
1475a0c3883a25
153705e93a1414
hex1b492ed25e31

30001132101169 has 2 divisors, whose sum is σ = 30001132101170. Its totient is φ = 30001132101168.

The previous prime is 30001132101089. The next prime is 30001132101203. The reversal of 30001132101169 is 96110123110003.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 28439694420544 + 1561437680625 = 5332888^2 + 1249575^2 .

It is a cyclic number.

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

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

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

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

Almost surely, 230001132101169 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 30001132101169 in words is "thirty trillion, one billion, one hundred thirty-two million, one hundred one thousand, one hundred sixty-nine".