Search a number
-
+
30100101313 is a prime number
BaseRepresentation
bin11100000010000110…
…110001100011000001
32212200201122120120011
4130002012301203001
5443121111220223
621454445344521
72113623432262
oct340206614301
985621576504
1030100101313
11118467a4697
125a00568141
132ab9042a49
141657864969
15bb27ed80d
hex7021b18c1

30100101313 has 2 divisors, whose sum is σ = 30100101314. Its totient is φ = 30100101312.

The previous prime is 30100101307. The next prime is 30100101323. The reversal of 30100101313 is 31310100103.

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 28962253489 + 1137847824 = 170183^2 + 33732^2 .

It is an emirp because it is prime and its reverse (31310100103) is a distict prime.

It is a cyclic number.

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

It is a junction number, because it is equal to n+sod(n) for n = 30100101293 and 30100101302.

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

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

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

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

Almost surely, 230100101313 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 27, while the sum is 13.

Adding to 30100101313 its reverse (31310100103), we get a palindrome (61410201416).

The spelling of 30100101313 in words is "thirty billion, one hundred million, one hundred one thousand, three hundred thirteen".