Base | Representation |
---|---|
bin | 11100110101110… |
… | …00110111010000 |
3 | 121212020022010112 |
4 | 32122320313100 |
5 | 443413222210 |
6 | 40001220452 |
7 | 5665240226 |
oct | 1632706720 |
9 | 555208115 |
10 | 241929680 |
11 | 114621393 |
12 | 69031728 |
13 | 3b178275 |
14 | 241b8b16 |
15 | 1638cd05 |
hex | e6b8dd0 |
241929680 has 90 divisors (see below), whose sum is σ = 590661414. Its totient is φ = 92153088.
The previous prime is 241929659. The next prime is 241929689. The reversal of 241929680 is 86929142.
It can be written as a sum of positive squares in 3 ways, for example, as 118897216 + 123032464 = 10904^2 + 11092^2 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (241929689) by changing a digit.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 5147417 + ... + 5147463.
Almost surely, 2241929680 is an apocalyptic number.
241929680 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 241929680, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (295330707).
241929680 is an abundant number, since it is smaller than the sum of its proper divisors (348731734).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
241929680 is an equidigital number, since it uses as much as digits as its factorization.
241929680 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 181 (or 91 counting only the distinct ones).
The product of its (nonzero) digits is 62208, while the sum is 41.
The square root of 241929680 is about 15554.0888514885. The cubic root of 241929680 is about 623.1076028492.
The spelling of 241929680 in words is "two hundred forty-one million, nine hundred twenty-nine thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •