Search a number
-
+
1040151311 is a prime number
BaseRepresentation
bin111101111111110…
…111001100001111
32200111020011100122
4331333313030033
54112234320221
6251114015155
734530066053
oct7577671417
92614204318
101040151311
11494158091
122504174bb
13137657864
149c1ddc63
15614b2eab
hex3dff730f

1040151311 has 2 divisors, whose sum is σ = 1040151312. Its totient is φ = 1040151310.

The previous prime is 1040151283. The next prime is 1040151319. The reversal of 1040151311 is 1131510401.

It is a strong prime.

It is a cyclic number.

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

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

It is a congruent number.

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

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

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

Almost surely, 21040151311 is an apocalyptic number.

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

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

1040151311 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 60, while the sum is 17.

The square root of 1040151311 is about 32251.3768853362. The cubic root of 1040151311 is about 1013.2085367460.

Adding to 1040151311 its reverse (1131510401), we get a palindrome (2171661712).

The spelling of 1040151311 in words is "one billion, forty million, one hundred fifty-one thousand, three hundred eleven".