Search a number
-
+
39152131 is a prime number
BaseRepresentation
bin1001010101011…
…0101000000011
32201200010121221
42111112220003
540010332011
63515055511
7653534104
oct225265003
981603557
1039152131
1120111637
1211141597
13815a955
1452b23ab
153685971
hex2556a03

39152131 has 2 divisors, whose sum is σ = 39152132. Its totient is φ = 39152130.

The previous prime is 39152123. The next prime is 39152147. The reversal of 39152131 is 13125193.

It is a weak prime.

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

It is a cyclic number.

It is not a de Polignac number, because 39152131 - 23 = 39152123 is a prime.

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

It is equal to p2385115 and since 39152131 and 2385115 have the same sum of digits, it is a Honaker prime.

It is a junction number, because it is equal to n+sod(n) for n = 39152096 and 39152105.

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

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

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

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

Almost surely, 239152131 is an apocalyptic number.

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

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

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

The product of its digits is 810, while the sum is 25.

The square root of 39152131 is about 6257.1663714496. The cubic root of 39152131 is about 339.5615195325.

The spelling of 39152131 in words is "thirty-nine million, one hundred fifty-two thousand, one hundred thirty-one".