Search a number
-
+
1015449157 is a prime number
BaseRepresentation
bin111100100001101…
…000011001000101
32121202202011101001
4330201220121011
54034423333112
6244432333301
734110114112
oct7441503105
92552664331
101015449157
11481215a88
122440a4231
131324b90b8
1498c0d909
155e233c57
hex3c868645

1015449157 has 2 divisors, whose sum is σ = 1015449158. Its totient is φ = 1015449156.

The previous prime is 1015449143. The next prime is 1015449161. The reversal of 1015449157 is 7519445101.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 602506116 + 412943041 = 24546^2 + 20321^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-1015449157 is a prime.

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

It is a congruent number.

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

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

Almost surely, 21015449157 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 25200, while the sum is 37.

The square root of 1015449157 is about 31866.1129885651. The cubic root of 1015449157 is about 1005.1234246904.

The spelling of 1015449157 in words is "one billion, fifteen million, four hundred forty-nine thousand, one hundred fifty-seven".