Search a number
-
+
38915641 is a prime number
BaseRepresentation
bin1001010001110…
…0111000111001
32201020010020001
42110130320321
534430300031
63510033001
7651530452
oct224347071
981203201
1038915641
111aa6a996
1211048761
1380a710b
145250129
15363a861
hex251ce39

38915641 has 2 divisors, whose sum is σ = 38915642. Its totient is φ = 38915640.

The previous prime is 38915587. The next prime is 38915647. The reversal of 38915641 is 14651983.

38915641 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 25040016 + 13875625 = 5004^2 + 3725^2 .

It is a cyclic number.

It is not a de Polignac number, because 38915641 - 221 = 36818489 is a prime.

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

It is a self number, because there is not a number n which added to its sum of digits gives 38915641.

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

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

Almost surely, 238915641 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 25920, while the sum is 37.

The square root of 38915641 is about 6238.2402165995. The cubic root of 38915641 is about 338.8764556498.

The spelling of 38915641 in words is "thirty-eight million, nine hundred fifteen thousand, six hundred forty-one".