Search a number
-
+
201101013251 is a prime number
BaseRepresentation
bin1011101101001010001…
…1011111000100000011
3201020002002000221201222
42323102203133010003
511243323324411001
6232215020345255
720346320260115
oct2732243370403
9636062027658
10201101013251
1178317308806
1232b843a522b
1315c6b4660c8
149a3a4053b5
15536ee5a61b
hex2ed28df103

201101013251 has 2 divisors, whose sum is σ = 201101013252. Its totient is φ = 201101013250.

The previous prime is 201101013209. The next prime is 201101013367. The reversal of 201101013251 is 152310101102.

201101013251 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 201101013251 - 26 = 201101013187 is a prime.

It is a Sophie Germain prime.

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

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

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

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

Almost surely, 2201101013251 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 60, while the sum is 17.

Adding to 201101013251 its reverse (152310101102), we get a palindrome (353411114353).

The spelling of 201101013251 in words is "two hundred one billion, one hundred one million, thirteen thousand, two hundred fifty-one".