Search a number
-
+
30315651133 is a prime number
BaseRepresentation
bin11100001110111101…
…000010000000111101
32220020202020122022211
4130032331002000331
5444041301314013
621532105340421
72122151532355
oct341675020075
986222218284
1030315651133
1111947438439
125a60797711
132b218b2a11
141678333b65
15bc66ca23d
hex70ef4203d

30315651133 has 2 divisors, whose sum is σ = 30315651134. Its totient is φ = 30315651132.

The previous prime is 30315651131. The next prime is 30315651181. The reversal of 30315651133 is 33115651303.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 28534979929 + 1780671204 = 168923^2 + 42198^2 .

It is a cyclic number.

It is not a de Polignac number, because 30315651133 - 21 = 30315651131 is a prime.

Together with 30315651131, it forms a pair of twin primes.

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

It is a congruent number.

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

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

Almost surely, 230315651133 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 12150, while the sum is 31.

The spelling of 30315651133 in words is "thirty billion, three hundred fifteen million, six hundred fifty-one thousand, one hundred thirty-three".