Base | Representation |
---|---|
bin | 11100110000100… |
… | …10111110011000 |
3 | 121210221210001121 |
4 | 32120102332120 |
5 | 443230001300 |
6 | 35534455024 |
7 | 5656410232 |
oct | 1630227630 |
9 | 553853047 |
10 | 241250200 |
11 | 1141a7934 |
12 | 68964474 |
13 | 3ac9abc9 |
14 | 2407d252 |
15 | 162a681a |
hex | e612f98 |
241250200 has 48 divisors (see below), whose sum is σ = 568044000. Its totient is φ = 95272320.
The previous prime is 241250189. The next prime is 241250237. The reversal of 241250200 is 2052142.
241250200 is digitally balanced in base 2, 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 11 ways as a sum of consecutive naturals, for example, 8166 + ... + 23434.
It is an arithmetic number, because the mean of its divisors is an integer number (11834250).
Almost surely, 2241250200 is an apocalyptic number.
241250200 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 241250200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (284022000).
241250200 is an abundant number, since it is smaller than the sum of its proper divisors (326793800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
241250200 is a wasteful number, since it uses less digits than its factorization.
241250200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15364 (or 15355 counting only the distinct ones).
The product of its (nonzero) digits is 160, while the sum is 16.
The square root of 241250200 is about 15532.2310052355. The cubic root of 241250200 is about 622.5237057041.
The spelling of 241250200 in words is "two hundred forty-one million, two hundred fifty thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •