Search a number
-
+
30916757 is a prime number
BaseRepresentation
bin111010111110…
…0000010010101
32011011201211002
41311330002111
530403314012
63022353045
7523534214
oct165740225
964151732
1030916757
11164a7243
12a42b785
136536351
14416b07b
152aaa7c2
hex1d7c095

30916757 has 2 divisors, whose sum is σ = 30916758. Its totient is φ = 30916756.

The previous prime is 30916733. The next prime is 30916759. The reversal of 30916757 is 75761903.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 26615281 + 4301476 = 5159^2 + 2074^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-30916757 is a prime.

Together with 30916759, 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 30916757.

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

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

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

Almost surely, 230916757 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The square root of 30916757 is about 5560.2838956298. The cubic root of 30916757 is about 313.8566325912.

The spelling of 30916757 in words is "thirty million, nine hundred sixteen thousand, seven hundred fifty-seven".