Search a number
-
+
30145567 is a prime number
BaseRepresentation
bin111001011111…
…1110000011111
32002201112221111
41302333300133
530204124232
62554042451
7514142644
oct162776037
962645844
1030145567
111601a8a1
12a119427
13632631a
144009dcb
1529a7047
hex1cbfc1f

30145567 has 2 divisors, whose sum is σ = 30145568. Its totient is φ = 30145566.

The previous prime is 30145561. The next prime is 30145579. The reversal of 30145567 is 76554103.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 30145567 - 27 = 30145439 is a prime.

It is a congruent number.

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

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

Almost surely, 230145567 is an apocalyptic number.

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

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

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

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

The square root of 30145567 is about 5490.4978827061. The cubic root of 30145567 is about 311.2250071597.

The spelling of 30145567 in words is "thirty million, one hundred forty-five thousand, five hundred sixty-seven".