Search a number
-
+
20000151 = 322222239
BaseRepresentation
bin100110001001…
…0110110010111
31101122010001100
41030102312113
520110001101
61552401143
7331666323
oct114226627
941563040
1020000151
1110320456
1268461b3
1341b3512
142928983
151b50e86
hex1312d97

20000151 has 6 divisors (see below), whose sum is σ = 28889120. Its totient is φ = 13333428.

The previous prime is 20000147. The next prime is 20000153. The reversal of 20000151 is 15100002.

It is a happy number.

It is not a de Polignac number, because 20000151 - 22 = 20000147 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (9), and also a Moran number because the ratio is a prime number: 2222239 = 20000151 / (2 + 0 + 0 + 0 + 0 + 1 + 5 + 1).

It is a Duffinian number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (20000153) by changing a digit.

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

It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1111111 + ... + 1111128.

Almost surely, 220000151 is an apocalyptic number.

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

20000151 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 2222245 (or 2222242 counting only the distinct ones).

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

The square root of 20000151 is about 4472.1528372809. The cubic root of 20000151 is about 271.4424447862.

Adding to 20000151 its reverse (15100002), we get a palindrome (35100153).

The spelling of 20000151 in words is "twenty million, one hundred fifty-one", and thus it is an aban number.

Divisors: 1 3 9 2222239 6666717 20000151