Search a number
-
+
40152652157 is a prime number
BaseRepresentation
bin100101011001010010…
…001101100101111101
310211122022022001220002
4211121102031211331
51124213034332112
630240150404045
72621006624552
oct453122154575
9124568261802
1040152652157
1116035141952
127947060625
133a2b89c697
141d2c986a29
1510a00dc1c2
hex95948d97d

40152652157 has 2 divisors, whose sum is σ = 40152652158. Its totient is φ = 40152652156.

The previous prime is 40152652123. The next prime is 40152652207. The reversal of 40152652157 is 75125625104.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 32022744601 + 8129907556 = 178949^2 + 90166^2 .

It is a cyclic number.

It is not a de Polignac number, because 40152652157 - 28 = 40152651901 is a prime.

It is a super-2 number, since 2×401526521572 (a number of 22 digits) contains 22 as substring.

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

It is a congruent number.

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

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

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

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

Almost surely, 240152652157 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 84000, while the sum is 38.

The spelling of 40152652157 in words is "forty billion, one hundred fifty-two million, six hundred fifty-two thousand, one hundred fifty-seven".