Base | Representation |
---|---|
bin | 100110001100… |
… | …1010100011010 |
3 | 1101200110101210 |
4 | 1030121110122 |
5 | 20111323100 |
6 | 1553123550 |
7 | 332136510 |
oct | 114312432 |
9 | 41613353 |
10 | 20026650 |
11 | 10339356 |
12 | 68595b6 |
13 | 41c25b7 |
14 | 29344b0 |
15 | 1b58c50 |
hex | 131951a |
20026650 has 48 divisors (see below), whose sum is σ = 56764224. Its totient is φ = 4577280.
The previous prime is 20026639. The next prime is 20026673. The reversal of 20026650 is 5662002.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 8487 + ... + 10586.
It is an arithmetic number, because the mean of its divisors is an integer number (1182588).
Almost surely, 220026650 is an apocalyptic number.
20026650 is an abundant number, since it is smaller than the sum of its proper divisors (36737574).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20026650 is a wasteful number, since it uses less digits than its factorization.
20026650 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19095 (or 19090 counting only the distinct ones).
The product of its (nonzero) digits is 720, while the sum is 21.
The square root of 20026650 is about 4475.1145236742. The cubic root of 20026650 is about 271.5622735304.
Adding to 20026650 its reverse (5662002), we get a palindrome (25688652).
The spelling of 20026650 in words is "twenty million, twenty-six thousand, six hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •