[go: up one dir, main page]

Search a number
-
+
20002151 = 131538627
BaseRepresentation
bin100110001001…
…1010101100111
31101122012210102
41030103111213
520110032101
61552414315
7332005211
oct114232547
941565712
1020002151
1110321a04
12684739b
1341b43c0
1429295b1
151b5186b
hex1313567

20002151 has 4 divisors (see below), whose sum is σ = 21540792. Its totient is φ = 18463512.

The previous prime is 20002133. The next prime is 20002159. The reversal of 20002151 is 15120002.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 20002151 - 214 = 19985767 is a prime.

20002151 is a modest number, since divided by 2151 gives 2 as remainder.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (20002159) 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 3 ways as a sum of consecutive naturals, for example, 769301 + ... + 769326.

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

Almost surely, 220002151 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1538640.

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

The square root of 20002151 is about 4472.3764376448. The cubic root of 20002151 is about 271.4514924978.

Adding to 20002151 its reverse (15120002), we get a palindrome (35122153).

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

Divisors: 1 13 1538627 20002151