Search a number
-
+
10301115064153 is a prime number
BaseRepresentation
bin1001010111100110101001…
…0011011101111101011001
31100110202222102100102000211
42111321222103131331121
52322233140424023103
633524133353531121
72112142143223564
oct225715223357531
940422872312024
1010301115064153
1133117509a4541
1211a4512713aa1
13599510cb06b4
142788103b14db
1512ce5046136d
hex95e6a4ddf59

10301115064153 has 2 divisors, whose sum is σ = 10301115064154. Its totient is φ = 10301115064152.

The previous prime is 10301115064129. The next prime is 10301115064171. The reversal of 10301115064153 is 35146051110301.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 10144301440144 + 156813624009 = 3185012^2 + 395997^2 .

It is a cyclic number.

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

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

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

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

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

Almost surely, 210301115064153 is an apocalyptic number.

It is an amenable number.

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

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

10301115064153 is an evil number, because the sum of its binary digits is even.

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

Adding to 10301115064153 its reverse (35146051110301), we get a palindrome (45447166174454).

The spelling of 10301115064153 in words is "ten trillion, three hundred one billion, one hundred fifteen million, sixty-four thousand, one hundred fifty-three".