Search a number
-
+
10131003100147 is a prime number
BaseRepresentation
bin1001001101101100111011…
…0101110100101111110011
31022212111220000200021011111
42103123032311310233303
52311441243243201042
633314041340054151
72063640462334006
oct223331665645763
938774800607144
1010131003100147
113256597154136
121177558534357
13586470ab4327
142704b391153d
151287e5d9b517
hex936ced74bf3

10131003100147 has 2 divisors, whose sum is σ = 10131003100148. Its totient is φ = 10131003100146.

The previous prime is 10131003100081. The next prime is 10131003100187. The reversal of 10131003100147 is 74100130013101.

It is a strong prime.

It is a cyclic number.

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

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

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

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

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

Almost surely, 210131003100147 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 252, while the sum is 22.

Adding to 10131003100147 its reverse (74100130013101), we get a palindrome (84231133113248).

The spelling of 10131003100147 in words is "ten trillion, one hundred thirty-one billion, three million, one hundred thousand, one hundred forty-seven".