Search a number
-
+
4015197157 is a prime number
BaseRepresentation
bin1110111101010011…
…0000101111100101
3101100211022011000211
43233110300233211
531210342302112
61502231335421
7201333420106
oct35724605745
911324264024
104015197157
111780524064
12940821571
134bcb12a0a
142a138c3ad
151877780a7
hexef530be5

4015197157 has 2 divisors, whose sum is σ = 4015197158. Its totient is φ = 4015197156.

The previous prime is 4015197143. The next prime is 4015197217. The reversal of 4015197157 is 7517915104.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 3923017956 + 92179201 = 62634^2 + 9601^2 .

It is a cyclic number.

It is not a de Polignac number, because 4015197157 - 211 = 4015195109 is a prime.

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

It is a congruent number.

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

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

Almost surely, 24015197157 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 44100, while the sum is 40.

The square root of 4015197157 is about 63365.5833793077. The cubic root of 4015197157 is about 1589.4088433016.

The spelling of 4015197157 in words is "four billion, fifteen million, one hundred ninety-seven thousand, one hundred fifty-seven".