Search a number
-
+
1315150159 is a prime number
BaseRepresentation
bin100111001100011…
…1001100101001111
310101122200112212011
41032120321211033
510143134301114
6334300122051
744406410011
oct11630714517
93348615764
101315150159
11615405864
12308536327
1317c610a7b
14c69461b1
157a6d41c4
hex4e63994f

1315150159 has 2 divisors, whose sum is σ = 1315150160. Its totient is φ = 1315150158.

The previous prime is 1315150127. The next prime is 1315150171. The reversal of 1315150159 is 9510515131.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 1315150159 - 25 = 1315150127 is a prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 21315150159 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 3375, while the sum is 31.

The square root of 1315150159 is about 36264.9990900317. Note that the first 3 decimals coincide. The cubic root of 1315150159 is about 1095.6162052285.

It can be divided in two parts, 131515015 and 9, that added together give a square (131515024 = 114682).

The spelling of 1315150159 in words is "one billion, three hundred fifteen million, one hundred fifty thousand, one hundred fifty-nine".