Search a number
-
+
152690917 is a prime number
BaseRepresentation
bin10010001100111…
…10000011100101
3101122022111120011
421012132003211
5303042102132
623052410221
73532565011
oct1106360345
9348274504
10152690917
117920aa45
1243176971
1325831972
14163c9541
15d611b47
hex919e0e5

152690917 has 2 divisors, whose sum is σ = 152690918. Its totient is φ = 152690916.

The previous prime is 152690873. The next prime is 152690927. The reversal of 152690917 is 719096251.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 151757761 + 933156 = 12319^2 + 966^2 .

It is a cyclic number.

It is not a de Polignac number, because 152690917 - 211 = 152688869 is a prime.

It is a super-2 number, since 2×1526909172 = 46629032268601778, which contains 22 as substring.

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

It is a congruent number.

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

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

Almost surely, 2152690917 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 34020, while the sum is 40.

The square root of 152690917 is about 12356.8166207968. The cubic root of 152690917 is about 534.4877234561.

The spelling of 152690917 in words is "one hundred fifty-two million, six hundred ninety thousand, nine hundred seventeen".