Base | Representation |
---|---|
bin | 11100110000111… |
… | …01100010111100 |
3 | 121211000222110022 |
4 | 32120131202330 |
5 | 443232343000 |
6 | 35535431312 |
7 | 5656650410 |
oct | 1630354274 |
9 | 554028408 |
10 | 241293500 |
11 | 114227418 |
12 | 68985538 |
13 | 3acb4826 |
14 | 24090d40 |
15 | 162b4585 |
hex | e61d8bc |
241293500 has 96 divisors (see below), whose sum is σ = 611380224. Its totient is φ = 81480000.
The previous prime is 241293497. The next prime is 241293527. The reversal of 241293500 is 5392142.
It is a self number, because there is not a number n which added to its sum of digits gives 241293500.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 248015 + ... + 248985.
It is an arithmetic number, because the mean of its divisors is an integer number (6368544).
Almost surely, 2241293500 is an apocalyptic number.
241293500 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 241293500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (305690112).
241293500 is an abundant number, since it is smaller than the sum of its proper divisors (370086724).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
241293500 is a wasteful number, since it uses less digits than its factorization.
241293500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1068 (or 1056 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 26.
The square root of 241293500 is about 15533.6248184382. The cubic root of 241293500 is about 622.5609473506.
The spelling of 241293500 in words is "two hundred forty-one million, two hundred ninety-three thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •