Search a number
-
+
30851151521 is a prime number
BaseRepresentation
bin11100101110110111…
…110011011010100001
32221122001212212202112
4130232313303122201
51001140343322041
622101155125105
72141343314111
oct345667633241
987561785675
1030851151521
11120a1741843
125b8bba3795
132ba8817558
1416c94cb041
15c08706deb
hex72edf36a1

30851151521 has 2 divisors, whose sum is σ = 30851151522. Its totient is φ = 30851151520.

The previous prime is 30851151509. The next prime is 30851151553. The reversal of 30851151521 is 12515115803.

It is an a-pointer prime, because the next prime (30851151553) can be obtained adding 30851151521 to its sum of digits (32).

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 20823933025 + 10027218496 = 144305^2 + 100136^2 .

It is a cyclic number.

It is not a de Polignac number, because 30851151521 - 222 = 30846957217 is a prime.

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

It is a Sophie Germain prime.

It is a Curzon number.

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

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

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

Almost surely, 230851151521 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 6000, while the sum is 32.

The spelling of 30851151521 in words is "thirty billion, eight hundred fifty-one million, one hundred fifty-one thousand, five hundred twenty-one".