Base | Representation |
---|---|
bin | 100110101001… |
… | …0001101000000 |
3 | 1102010022000100 |
4 | 1031102031000 |
5 | 20141302043 |
6 | 2002122400 |
7 | 334130013 |
oct | 115221500 |
9 | 42108010 |
10 | 20259648 |
11 | 10488412 |
12 | 6950400 |
13 | 4274676 |
14 | 299537a |
15 | 1ba2cd3 |
hex | 1352340 |
20259648 has 84 divisors (see below), whose sum is σ = 61516260. Its totient is φ = 6352896.
The previous prime is 20259641. The next prime is 20259649. The reversal of 20259648 is 84695202.
It is a happy number.
20259648 is a `hidden beast` number, since 2 + 0 + 2 + 5 + 9 + 648 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 9290304 + 10969344 = 3048^2 + 3312^2 .
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20259641) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 8758 + ... + 10826.
Almost surely, 220259648 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 20259648, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (30758130).
20259648 is an abundant number, since it is smaller than the sum of its proper divisors (41256612).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20259648 is a wasteful number, since it uses less digits than its factorization.
20259648 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2104 (or 2091 counting only the distinct ones).
The product of its (nonzero) digits is 34560, while the sum is 36.
The square root of 20259648 is about 4501.0718723433. The cubic root of 20259648 is about 272.6113699025.
The spelling of 20259648 in words is "twenty million, two hundred fifty-nine thousand, six hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •