Search a number
-
+
20609051 = 131157321
BaseRepresentation
bin100111010011…
…1100000011011
31102210001022012
41032213200123
520233442201
62013420135
7340113461
oct116474033
942701265
1020609051
11106a6981
126a9a64b
134367708
142a46831
151c215bb
hex13a781b

20609051 has 4 divisors (see below), whose sum is σ = 20766504. Its totient is φ = 20451600.

The previous prime is 20609041. The next prime is 20609089. The reversal of 20609051 is 15090602.

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 20609051 - 214 = 20592667 is a prime.

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (20609011) 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, 78530 + ... + 78791.

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

Almost surely, 220609051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 157452.

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

The square root of 20609051 is about 4539.7192644480. The cubic root of 20609051 is about 274.1696207629.

Adding to 20609051 its reverse (15090602), we get a palindrome (35699653).

It can be divided in two parts, 2060 and 9051, that added together give a palindrome (11111).

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

Divisors: 1 131 157321 20609051