Search a number
-
+
5003153231 is a prime number
BaseRepresentation
bin1001010100011011…
…00000111101001111
3110220200022111222112
410222031200331033
540221301400411
62144242534235
7234661046366
oct45215407517
913820274875
105003153231
11213817108a
12b7766737b
136196c3bcb
143566827dd
151e437ab8b
hex12a360f4f

5003153231 has 2 divisors, whose sum is σ = 5003153232. Its totient is φ = 5003153230.

The previous prime is 5003153191. The next prime is 5003153251. The reversal of 5003153231 is 1323513005.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 5003153231 - 222 = 4998958927 is a prime.

It is a super-2 number, since 2×50031532312 = 50063084505731478722, which contains 22 as substring.

It is a junction number, because it is equal to n+sod(n) for n = 5003153197 and 5003153206.

It is a congruent number.

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

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

Almost surely, 25003153231 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 1350, while the sum is 23.

The square root of 5003153231 is about 70732.9713146564. The cubic root of 5003153231 is about 1710.3353344161.

Adding to 5003153231 its reverse (1323513005), we get a palindrome (6326666236).

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