Search a number
-
+
13101142030153 is a prime number
BaseRepresentation
bin1011111010100101100011…
…1010101011011101001001
31201101110100010002000101021
42332221120322223131021
53204122114324431103
643510325341152441
72521345340565022
oct276513072533511
951343303060337
1013101142030153
1141a1188147a71
121577109b5b721
13740580c73438
14334154a05c49
1517abcdcaabbd
hexbea58eab749

13101142030153 has 2 divisors, whose sum is σ = 13101142030154. Its totient is φ = 13101142030152.

The previous prime is 13101142030099. The next prime is 13101142030177. The reversal of 13101142030153 is 35103024110131.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 7740236208384 + 5360905821769 = 2782128^2 + 2315363^2 .

It is a cyclic number.

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

It is a super-3 number, since 3×131011420301533 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.

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

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

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

Almost surely, 213101142030153 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 13101142030153 its reverse (35103024110131), we get a palindrome (48204166140284).

The spelling of 13101142030153 in words is "thirteen trillion, one hundred one billion, one hundred forty-two million, thirty thousand, one hundred fifty-three".