Search a number
-
+
30210101981 is a prime number
BaseRepresentation
bin11100001000101010…
…011001001011011101
32212222101122012002222
4130020222121023131
5443332241230411
621513415155125
72116430426033
oct341052311335
985871565088
1030210101981
11118a28a6834
125a31375aa5
132b05a784b7
1416682da553
15bbc2cb4db
hex708a992dd

30210101981 has 2 divisors, whose sum is σ = 30210101982. Its totient is φ = 30210101980.

The previous prime is 30210101963. The next prime is 30210102001. The reversal of 30210101981 is 18910101203.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 29429402500 + 780699481 = 171550^2 + 27941^2 .

It is a cyclic number.

It is not a de Polignac number, because 30210101981 - 210 = 30210100957 is a prime.

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

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

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

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

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

Almost surely, 230210101981 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 30210101981 in words is "thirty billion, two hundred ten million, one hundred one thousand, nine hundred eighty-one".