Search a number
-
+
40155617 is a prime number
BaseRepresentation
bin1001100100101…
…1100111100001
32210120010011002
42121023213201
540234434432
63552401345
7665213525
oct231134741
983503132
1040155617
1120737567
1211546255
13841c628
145493d85
1537d2e62
hex264b9e1

40155617 has 2 divisors, whose sum is σ = 40155618. Its totient is φ = 40155616.

The previous prime is 40155601. The next prime is 40155623. The reversal of 40155617 is 71655104.

40155617 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., 39137536 + 1018081 = 6256^2 + 1009^2 .

It is a cyclic number.

It is not a de Polignac number, because 40155617 - 24 = 40155601 is a prime.

It is a super-2 number, since 2×401556172 = 3224947153301378, 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 40155617.

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

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

Almost surely, 240155617 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 4200, while the sum is 29.

The square root of 40155617 is about 6336.8459820324. The cubic root of 40155617 is about 342.4381176493.

The spelling of 40155617 in words is "forty million, one hundred fifty-five thousand, six hundred seventeen".