Search a number
-
+
5015310201553 is a prime number
BaseRepresentation
bin100100011111011011111…
…0010000111001011010001
3122202110101120221221122011
41020332313302013023101
51124132323402422203
614400000211142521
71025226030220231
oct110766762071321
918673346857564
105015310201553
111663a879505a3
126900012a4a41
132a4c31c70622
14134a56c77cc1
158a6d68ac76d
hex48fb7c872d1

5015310201553 has 2 divisors, whose sum is σ = 5015310201554. Its totient is φ = 5015310201552.

The previous prime is 5015310201541. The next prime is 5015310201611. The reversal of 5015310201553 is 3551020135105.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 4218045148944 + 797265052609 = 2053788^2 + 892897^2 .

It is a cyclic number.

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

It is a super-2 number, since 2×50153102015532 (a number of 26 digits) contains 22 as substring.

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

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

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

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

Almost surely, 25015310201553 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 11250, while the sum is 31.

Adding to 5015310201553 its reverse (3551020135105), we get a palindrome (8566330336658).

The spelling of 5015310201553 in words is "five trillion, fifteen billion, three hundred ten million, two hundred one thousand, five hundred fifty-three".