Search a number
-
+
20001151 is a prime number
BaseRepresentation
bin100110001001…
…1000101111111
31101122011102101
41030103011333
520110014101
61552405531
7332002252
oct114230577
941564371
1020001151
1110321185
1268468a7
1341b3b01
142929099
151b51401
hex131317f

20001151 has 2 divisors, whose sum is σ = 20001152. Its totient is φ = 20001150.

The previous prime is 20001139. The next prime is 20001161. The reversal of 20001151 is 15110002.

It is a happy number.

It is an a-pointer prime, because the next prime (20001161) can be obtained adding 20001151 to its sum of digits (10).

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 20001151 - 223 = 11612543 is a prime.

It is a congruent number.

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

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

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

Almost surely, 220001151 is an apocalyptic number.

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

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

20001151 is an evil number, because the sum of its binary digits is even.

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

The square root of 20001151 is about 4472.2646388603. The cubic root of 20001151 is about 271.4469687174.

Adding to 20001151 its reverse (15110002), we get a palindrome (35111153).

The spelling of 20001151 in words is "twenty million, one thousand, one hundred fifty-one".