Search a number
-
+
15301003116031 is a prime number
BaseRepresentation
bin1101111010101000101011…
…0110101111110111111111
32000011202120012210222111021
43132222022312233313333
54001142423244203111
652313103411005011
73136314056361463
oct336521266576777
960152505728437
1015301003116031
11496a1343a9796
12187152ab99767
1386cb55b09969
143ac802d364a3
151b8032e1cd71
hexdea8adafdff

15301003116031 has 2 divisors, whose sum is σ = 15301003116032. Its totient is φ = 15301003116030.

The previous prime is 15301003116023. The next prime is 15301003116097. The reversal of 15301003116031 is 13061130010351.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 15301003116031 - 23 = 15301003116023 is a prime.

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

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

It is a congruent number.

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

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

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

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

Almost surely, 215301003116031 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 810, while the sum is 25.

Adding to 15301003116031 its reverse (13061130010351), we get a palindrome (28362133126382).

The spelling of 15301003116031 in words is "fifteen trillion, three hundred one billion, three million, one hundred sixteen thousand, thirty-one".