Search a number
-
+
30369511 is a prime number
BaseRepresentation
bin111001111011…
…0011011100111
32010010221010201
41303312123213
530233311021
63002531331
7516064564
oct163663347
963127121
1030369511
1116163077
12a206b47
1363a4233
14406786b
1529ed591
hex1cf66e7

30369511 has 2 divisors, whose sum is σ = 30369512. Its totient is φ = 30369510.

The previous prime is 30369503. The next prime is 30369529. The reversal of 30369511 is 11596303.

It is a weak prime.

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

It is a cyclic number.

It is not a de Polignac number, because 30369511 - 23 = 30369503 is a prime.

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 30369511.

It is a congruent number.

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

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

Almost surely, 230369511 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 2430, while the sum is 28.

The square root of 30369511 is about 5510.8539265707. The cubic root of 30369511 is about 311.9937779550.

The spelling of 30369511 in words is "thirty million, three hundred sixty-nine thousand, five hundred eleven".