Search a number
-
+
40395581 is a prime number
BaseRepresentation
bin1001101000011…
…0001100111101
32211000022022122
42122012030331
540320124311
64001452325
71000233242
oct232061475
984008278
1040395581
1120890886
12116410a5
1384a4915
1455175c9
15382e0db
hex268633d

40395581 has 2 divisors, whose sum is σ = 40395582. Its totient is φ = 40395580.

The previous prime is 40395559. The next prime is 40395583. The reversal of 40395581 is 18559304.

40395581 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., 23863225 + 16532356 = 4885^2 + 4066^2 .

It is a cyclic number.

It is not a de Polignac number, because 40395581 - 214 = 40379197 is a prime.

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

Together with 40395583, it forms a pair of twin primes.

It is a Chen prime.

It is a congruent number.

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

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

Almost surely, 240395581 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 21600, while the sum is 35.

The square root of 40395581 is about 6355.7518044681. The cubic root of 40395581 is about 343.1188831616.

The spelling of 40395581 in words is "forty million, three hundred ninety-five thousand, five hundred eighty-one".