Search a number
-
+
9512201001131 is a prime number
BaseRepresentation
bin1000101001101011101101…
…0111001001100010101011
31020200100122122100121122122
42022122323113021202223
52221321441424014011
632121502251341455
72001143131305533
oct212327327114253
936610578317578
109512201001131
113038113534334
121097640a5188b
1353ccc59ba15a
1424c5704ca4c3
1511767a5363db
hex8a6bb5c98ab

9512201001131 has 2 divisors, whose sum is σ = 9512201001132. Its totient is φ = 9512201001130.

The previous prime is 9512201001113. The next prime is 9512201001151. The reversal of 9512201001131 is 1311001022159.

Together with previous prime (9512201001113) it forms an Ormiston pair, because they use the same digits, order apart.

It is a weak prime.

It is a cyclic number.

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

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

It is a self number, because there is not a number n which added to its sum of digits gives 9512201001131.

It is not a weakly prime, because it can be changed into another prime (9512201001151) 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, 4756100500565 + 4756100500566.

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

Almost surely, 29512201001131 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 540, while the sum is 26.

The spelling of 9512201001131 in words is "nine trillion, five hundred twelve billion, two hundred one million, one thousand, one hundred thirty-one".