Search a number
-
+
1333140317 is a prime number
BaseRepresentation
bin100111101110110…
…0001101101011101
310102220112112201022
41033131201231131
510212240442232
6340141453525
745015335315
oct11735415535
93386475638
101333140317
11624583063
123125712a5
1318326c432
14c90aa445
157c089812
hex4f761b5d

1333140317 has 2 divisors, whose sum is σ = 1333140318. Its totient is φ = 1333140316.

The previous prime is 1333140313. The next prime is 1333140343. The reversal of 1333140317 is 7130413331.

It is an a-pointer prime, because the next prime (1333140343) can be obtained adding 1333140317 to its sum of digits (26).

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 1297008196 + 36132121 = 36014^2 + 6011^2 .

It is a cyclic number.

It is not a de Polignac number, because 1333140317 - 22 = 1333140313 is a prime.

It is a congruent number.

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

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

Almost surely, 21333140317 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2268, while the sum is 26.

The square root of 1333140317 is about 36512.1940863597. The cubic root of 1333140317 is about 1100.5893032443.

Adding to 1333140317 its reverse (7130413331), we get a palindrome (8463553648).

The spelling of 1333140317 in words is "one billion, three hundred thirty-three million, one hundred forty thousand, three hundred seventeen".