Base | Representation |
---|---|
bin | 100110011101… |
… | …1000110001000 |
3 | 1101221111011212 |
4 | 1030323012020 |
5 | 20130240000 |
6 | 2000112252 |
7 | 333254042 |
oct | 114730610 |
9 | 41844155 |
10 | 20165000 |
11 | 10423299 |
12 | 6905688 |
13 | 424056b |
14 | 296ca92 |
15 | 1b84c35 |
hex | 133b188 |
20165000 has 80 divisors (see below), whose sum is σ = 48968700. Its totient is φ = 7776000.
The previous prime is 20164981. The next prime is 20165003. The reversal of 20165000 is 56102.
It can be written as a sum of positive squares in 10 ways, for example, as 40804 + 20124196 = 202^2 + 4486^2 .
It is not an unprimeable number, because it can be changed into a prime (20165003) 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 19 ways as a sum of consecutive naturals, for example, 184946 + ... + 185054.
Almost surely, 220165000 is an apocalyptic number.
20165000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 20165000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (24484350).
20165000 is an abundant number, since it is smaller than the sum of its proper divisors (28803700).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20165000 is a wasteful number, since it uses less digits than its factorization.
20165000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 172 (or 153 counting only the distinct ones).
The product of its (nonzero) digits is 60, while the sum is 14.
The square root of 20165000 is about 4490.5456238635. The cubic root of 20165000 is about 272.1861830829.
The spelling of 20165000 in words is "twenty million, one hundred sixty-five thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •