Search a number
-
+
1513290971 is a prime number
BaseRepresentation
bin101101000110010…
…1111110011011011
310220110112010221202
41122030233303123
511044400302341
6410055024415
752333522013
oct13214576333
93813463852
101513290971
117072389a5
1236296b10b
131b1696a5a
14104da2c43
158ccc279b
hex5a32fcdb

1513290971 has 2 divisors, whose sum is σ = 1513290972. Its totient is φ = 1513290970.

The previous prime is 1513290917. The next prime is 1513290991. The reversal of 1513290971 is 1790923151.

Together with previous prime (1513290917) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 1513290971 - 26 = 1513290907 is a prime.

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

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

Almost surely, 21513290971 is an apocalyptic number.

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

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

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

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

The square root of 1513290971 is about 38901.0407444325. The cubic root of 1513290971 is about 1148.0852752945.

The spelling of 1513290971 in words is "one billion, five hundred thirteen million, two hundred ninety thousand, nine hundred seventy-one".