Base | Representation |
---|---|
bin | 100110101000… |
… | …0100010000000 |
3 | 1102002221121201 |
4 | 1031100202000 |
5 | 20141042200 |
6 | 2002030544 |
7 | 334101031 |
oct | 115204200 |
9 | 42087551 |
10 | 20252800 |
11 | 10483257 |
12 | 6948454 |
13 | 4271509 |
14 | 2992a88 |
15 | 1ba0c6a |
hex | 1350880 |
20252800 has 48 divisors (see below), whose sum is σ = 50038650. Its totient is φ = 8099840.
The previous prime is 20252783. The next prime is 20252807. The reversal of 20252800 is 825202.
It can be written as a sum of positive squares in 3 ways, for example, as 17239104 + 3013696 = 4152^2 + 1736^2 .
It is not an unprimeable number, because it can be changed into a prime (20252807) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 36 + ... + 6364.
Almost surely, 220252800 is an apocalyptic number.
20252800 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 20252800, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (25019325).
20252800 is an abundant number, since it is smaller than the sum of its proper divisors (29785850).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20252800 is an equidigital number, since it uses as much as digits as its factorization.
20252800 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6353 (or 6336 counting only the distinct ones).
The product of its (nonzero) digits is 320, while the sum is 19.
The square root of 20252800 is about 4500.3111003574. The cubic root of 20252800 is about 272.5806511549.
The spelling of 20252800 in words is "twenty million, two hundred fifty-two thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •