Search a number
-
+
30469505489 is a prime number
BaseRepresentation
bin11100011000000111…
…111100000111010001
32220122110202020211022
4130120013330013101
5444400143133424
621555243125225
72126030344343
oct343007740721
986573666738
1030469505489
1111a162724a5
125aa4213815
132b477310b7
141690943293
15bd4e6b95e
hex7181fc1d1

30469505489 has 2 divisors, whose sum is σ = 30469505490. Its totient is φ = 30469505488.

The previous prime is 30469505449. The next prime is 30469505491. The reversal of 30469505489 is 98450596403.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 17406844225 + 13062661264 = 131935^2 + 114292^2 .

It is a cyclic number.

It is not a de Polignac number, because 30469505489 - 220 = 30468456913 is a prime.

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

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

It is a Chen prime.

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

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

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

Almost surely, 230469505489 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 4665600, while the sum is 53.

The spelling of 30469505489 in words is "thirty billion, four hundred sixty-nine million, five hundred five thousand, four hundred eighty-nine".