Base | Representation |
---|---|
bin | 11000001000110… |
… | …10111000000000 |
3 | 112010000022112122 |
4 | 30010122320000 |
5 | 403314011443 |
6 | 32031543412 |
7 | 5006045000 |
oct | 1404327000 |
9 | 463008478 |
10 | 202485248 |
11 | a4330189 |
12 | 5798ab68 |
13 | 32c47574 |
14 | 1cc6c000 |
15 | 12b9a968 |
hex | c11ae00 |
202485248 has 80 divisors (see below), whose sum is σ = 472216800. Its totient is φ = 86704128.
The previous prime is 202485229. The next prime is 202485253. The reversal of 202485248 is 842584202.
202485248 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 175040 + ... + 176192.
It is an arithmetic number, because the mean of its divisors is an integer number (5902710).
Almost surely, 2202485248 is an apocalyptic number.
202485248 is a gapful number since it is divisible by the number (28) 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 202485248, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (236108400).
202485248 is an abundant number, since it is smaller than the sum of its proper divisors (269731552).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
202485248 is an frugal number, since it uses more digits than its factorization.
202485248 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1192 (or 1162 counting only the distinct ones).
The product of its (nonzero) digits is 40960, while the sum is 35.
The square root of 202485248 is about 14229.7311288724. The cubic root of 202485248 is about 587.2158860445.
The spelling of 202485248 in words is "two hundred two million, four hundred eighty-five thousand, two hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •