Base | Representation |
---|---|
bin | 100111101010… |
… | …1101100011000 |
3 | 1110010122210220 |
4 | 1033111230120 |
5 | 20311020412 |
6 | 2021440040 |
7 | 341532150 |
oct | 117255430 |
9 | 43118726 |
10 | 20798232 |
11 | 10816024 |
12 | 6b70020 |
13 | 4402860 |
14 | 2a95760 |
15 | 1c5c68c |
hex | 13d5b18 |
20798232 has 128 divisors (see below), whose sum is σ = 65318400. Its totient is φ = 5372928.
The previous prime is 20798231. The next prime is 20798263. The reversal of 20798232 is 23289702.
It is a junction number, because it is equal to n+sod(n) for n = 20798193 and 20798202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20798231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 194323 + ... + 194429.
It is an arithmetic number, because the mean of its divisors is an integer number (510300).
Almost surely, 220798232 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 20798232, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (32659200).
20798232 is an abundant number, since it is smaller than the sum of its proper divisors (44520168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20798232 is a wasteful number, since it uses less digits than its factorization.
20798232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 225 (or 221 counting only the distinct ones).
The product of its (nonzero) digits is 12096, while the sum is 33.
The square root of 20798232 is about 4560.5078664552. The cubic root of 20798232 is about 275.0059811371.
The spelling of 20798232 in words is "twenty million, seven hundred ninety-eight thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •