Base | Representation |
---|---|
bin | 11100110001110… |
… | …00001011000000 |
3 | 121211020112001120 |
4 | 32120320023000 |
5 | 443244340220 |
6 | 35542032240 |
7 | 5660613360 |
oct | 1630701300 |
9 | 554215046 |
10 | 241402560 |
11 | 1142a1353 |
12 | 68a18680 |
13 | 3b022369 |
14 | 240bc9a0 |
15 | 162d6a40 |
hex | e6382c0 |
241402560 has 112 divisors (see below), whose sum is σ = 875970816. Its totient is φ = 55176192.
The previous prime is 241402517. The next prime is 241402589. The reversal of 241402560 is 65204142.
It is a tau number, because it is divible by the number of its divisors (112).
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a self number, because there is not a number n which added to its sum of digits gives 241402560.
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 15 ways as a sum of consecutive naturals, for example, 11242 + ... + 24681.
It is an arithmetic number, because the mean of its divisors is an integer number (7821168).
Almost surely, 2241402560 is an apocalyptic number.
241402560 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
241402560 is an abundant number, since it is smaller than the sum of its proper divisors (634568256).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
241402560 is a wasteful number, since it uses less digits than its factorization.
241402560 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35950 (or 35940 counting only the distinct ones).
The product of its (nonzero) digits is 1920, while the sum is 24.
The square root of 241402560 is about 15537.1348710115. The cubic root of 241402560 is about 622.6547283962.
The spelling of 241402560 in words is "two hundred forty-one million, four hundred two thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •