Base | Representation |
---|---|
bin | 100111001100… |
… | …1000000111010 |
3 | 1102200000212122 |
4 | 1032121000322 |
5 | 20230042230 |
6 | 2012241242 |
7 | 336445430 |
oct | 116310072 |
9 | 42600778 |
10 | 20549690 |
11 | 10666317 |
12 | 6a70222 |
13 | 43466a5 |
14 | 2a2cd50 |
15 | 1c0dbe5 |
hex | 139903a |
20549690 has 64 divisors (see below), whose sum is σ = 44789760. Its totient is φ = 6639360.
The previous prime is 20549681. The next prime is 20549699. The reversal of 20549690 is 9694502.
It is an interprime number because it is at equal distance from previous prime (20549681) and next prime (20549699).
It is a super-2 number, since 2×205496902 = 844579518192200, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (35).
It is a self number, because there is not a number n which added to its sum of digits gives 20549690.
It is not an unprimeable number, because it can be changed into a prime (20549699) 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 31 ways as a sum of consecutive naturals, for example, 107495 + ... + 107685.
It is an arithmetic number, because the mean of its divisors is an integer number (699840).
Almost surely, 220549690 is an apocalyptic number.
20549690 is an abundant number, since it is smaller than the sum of its proper divisors (24240070).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20549690 is a wasteful number, since it uses less digits than its factorization.
20549690 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 287.
The product of its (nonzero) digits is 19440, while the sum is 35.
The square root of 20549690 is about 4533.1765904275. The cubic root of 20549690 is about 273.9061340434.
The spelling of 20549690 in words is "twenty million, five hundred forty-nine thousand, six hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •