Search a number
-
+
5133313153 is a prime number
BaseRepresentation
bin1001100011111100…
…00010010010000001
3111020202020022211101
410301332002102001
541003112010103
62205212414401
7241131304363
oct46176022201
914222208741
105133313153
1121a4692171
12bb3177401
1363a667407
14369a84d33
152009dba1d
hex131f82481

5133313153 has 2 divisors, whose sum is σ = 5133313154. Its totient is φ = 5133313152.

The previous prime is 5133313099. The next prime is 5133313177. The reversal of 5133313153 is 3513133315.

5133313153 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 5131143424 + 2169729 = 71632^2 + 1473^2 .

It is a cyclic number.

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

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

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

Almost surely, 25133313153 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 6075, while the sum is 28.

The square root of 5133313153 is about 71647.1433694324. The cubic root of 5133313153 is about 1725.0403298559.

Adding to 5133313153 its reverse (3513133315), we get a palindrome (8646446468).

The spelling of 5133313153 in words is "five billion, one hundred thirty-three million, three hundred thirteen thousand, one hundred fifty-three".