Base | Representation |
---|---|
bin | 11100110001010… |
… | …00111100110000 |
3 | 121211010100112020 |
4 | 32120220330300 |
5 | 443240341313 |
6 | 35540431440 |
7 | 5660233524 |
oct | 1630507460 |
9 | 554110466 |
10 | 241340208 |
11 | 11425951a |
12 | 689a8580 |
13 | 3acccb75 |
14 | 240a3d84 |
15 | 162c3323 |
hex | e628f30 |
241340208 has 80 divisors (see below), whose sum is σ = 654720000. Its totient is φ = 76504320.
The previous prime is 241340201. The next prime is 241340213. The reversal of 241340208 is 802043142.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is not an unprimeable number, because it can be changed into a prime (241340201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 86418 + ... + 89166.
It is an arithmetic number, because the mean of its divisors is an integer number (8184000).
Almost surely, 2241340208 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 241340208, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (327360000).
241340208 is an abundant number, since it is smaller than the sum of its proper divisors (413379792).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
241340208 is a wasteful number, since it uses less digits than its factorization.
241340208 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2850 (or 2844 counting only the distinct ones).
The product of its (nonzero) digits is 1536, while the sum is 24.
The square root of 241340208 is about 15535.1281938708. The cubic root of 241340208 is about 622.6011151692.
The spelling of 241340208 in words is "two hundred forty-one million, three hundred forty thousand, two hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •