Search a number
-
+
20095161 = 3311731249
BaseRepresentation
bin100110010101…
…0000010111001
31101210221101020
41030222002321
520121021121
61554413053
7332543322
oct114520271
941727336
1020095161
1110385879
126891189
134217838
142951449
151b6e1c6
hex132a0b9

20095161 has 16 divisors (see below), whose sum is σ = 27840000. Its totient is φ = 12879360.

The previous prime is 20095133. The next prime is 20095171. The reversal of 20095161 is 16159002.

It is not a de Polignac number, because 20095161 - 29 = 20094649 is a prime.

It is a Curzon number.

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

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 15465 + ... + 16713.

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

Almost surely, 220095161 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1456.

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

The square root of 20095161 is about 4482.7626526507. The cubic root of 20095161 is about 271.8715918188.

The spelling of 20095161 in words is "twenty million, ninety-five thousand, one hundred sixty-one".

Divisors: 1 3 31 93 173 519 1249 3747 5363 16089 38719 116157 216077 648231 6698387 20095161