Search a number
-
+
201130302120131 is a prime number
BaseRepresentation
bin101101101110110101001100…
…001101100010000011000011
3222101010212110120111000120202
4231232311030031202003003
5202330304324320321011
61551433552450355415
760236120245650566
oct5556651415420303
9871125416430522
10201130302120131
11590a49780aa72a
121a68449728bb6b
13882c676bc0047
143794a896dc4dd
15183bcd9e4623b
hexb6ed4c3620c3

201130302120131 has 2 divisors, whose sum is σ = 201130302120132. Its totient is φ = 201130302120130.

The previous prime is 201130302120107. The next prime is 201130302120149. The reversal of 201130302120131 is 131021203031102.

It is a happy number.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 201130302120131 - 226 = 201130235011267 is a prime.

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

It is a Sophie Germain prime.

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

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

Almost surely, 2201130302120131 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 216, while the sum is 20.

Adding to 201130302120131 its reverse (131021203031102), we get a palindrome (332151505151233).

The spelling of 201130302120131 in words is "two hundred one trillion, one hundred thirty billion, three hundred two million, one hundred twenty thousand, one hundred thirty-one".