Search a number
-
+
30451510469 is a prime number
BaseRepresentation
bin11100010111000011…
…010010110011000101
32220121012220000022002
4130113003102303011
5444331041313334
621553401315045
72125421365622
oct342703226305
986535800262
1030451510469
1111a070a1586
125a9a195a85
132b43aa0463
14168c3bb349
15bd35b4b7e
hex7170d2cc5

30451510469 has 2 divisors, whose sum is σ = 30451510470. Its totient is φ = 30451510468.

The previous prime is 30451510393. The next prime is 30451510477. The reversal of 30451510469 is 96401515403.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 23651364100 + 6800146369 = 153790^2 + 82463^2 .

It is a cyclic number.

It is not a de Polignac number, because 30451510469 - 28 = 30451510213 is a prime.

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

It is a congruent number.

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

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

Almost surely, 230451510469 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 64800, while the sum is 38.

The spelling of 30451510469 in words is "thirty billion, four hundred fifty-one million, five hundred ten thousand, four hundred sixty-nine".