Base | Representation |
---|---|
bin | 11100101111000… |
… | …11110011000000 |
3 | 121210120221222120 |
4 | 32113203303000 |
5 | 443202310320 |
6 | 35530404240 |
7 | 5654643654 |
oct | 1627436300 |
9 | 553527876 |
10 | 241056960 |
11 | 114085731 |
12 | 68890680 |
13 | 3ac30c71 |
14 | 2402ca64 |
15 | 16269440 |
hex | e5e3cc0 |
241056960 has 112 divisors (see below), whose sum is σ = 768864096. Its totient is φ = 63987712.
The previous prime is 241056943. The next prime is 241057021. The reversal of 241056960 is 69650142.
241056960 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 280852 + ... + 281708.
It is an arithmetic number, because the mean of its divisors is an integer number (6864858).
Almost surely, 2241056960 is an apocalyptic number.
241056960 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 241056960, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (384432048).
241056960 is an abundant number, since it is smaller than the sum of its proper divisors (527807136).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
241056960 is a wasteful number, since it uses less digits than its factorization.
241056960 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1170 (or 1160 counting only the distinct ones).
The product of its (nonzero) digits is 12960, while the sum is 33.
The square root of 241056960 is about 15526.0091459460. The cubic root of 241056960 is about 622.3574486895.
The spelling of 241056960 in words is "two hundred forty-one million, fifty-six thousand, nine hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •