Base | Representation |
---|---|
bin | 11100110011001… |
… | …11100000000000 |
3 | 121211121100222102 |
4 | 32121213200000 |
5 | 443322041131 |
6 | 35550125532 |
7 | 5662351505 |
oct | 1631474000 |
9 | 554540872 |
10 | 241596416 |
11 | 114413a66 |
12 | 68ab08a8 |
13 | 3b08c679 |
14 | 2412d4ac |
15 | 163241cb |
hex | e667800 |
241596416 has 72 divisors (see below), whose sum is σ = 507255840. Its totient is φ = 115027968.
The previous prime is 241596409. The next prime is 241596427. The reversal of 241596416 is 614695142.
It is a zygodrome in base 2.
It is a self number, because there is not a number n which added to its sum of digits gives 241596416.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1083281 + ... + 1083503.
It is an arithmetic number, because the mean of its divisors is an integer number (7045220).
Almost surely, 2241596416 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 241596416, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (253627920).
241596416 is an abundant number, since it is smaller than the sum of its proper divisors (265659424).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
241596416 is an equidigital number, since it uses as much as digits as its factorization.
241596416 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 291 (or 248 counting only the distinct ones).
The product of its digits is 51840, while the sum is 38.
The square root of 241596416 is about 15543.3720923100. The cubic root of 241596416 is about 622.8213560948.
The spelling of 241596416 in words is "two hundred forty-one million, five hundred ninety-six thousand, four hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •