Base | Representation |
---|---|
bin | 1001010011111101101000 |
3 | 11121000111210 |
4 | 21103331220 |
5 | 1111103224 |
6 | 124153120 |
7 | 26514543 |
oct | 11237550 |
9 | 4530453 |
10 | 2441064 |
11 | 141800a |
12 | 9987a0 |
13 | 676122 |
14 | 47785a |
15 | 333429 |
hex | 253f68 |
2441064 has 64 divisors (see below), whose sum is σ = 6704640. Its totient is φ = 737280.
The previous prime is 2441057. The next prime is 2441071. The reversal of 2441064 is 4601442.
It is an interprime number because it is at equal distance from previous prime (2441057) and next prime (2441071).
It is an Ulam number.
It is a self number, because there is not a number n which added to its sum of digits gives 2441064.
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, 12552 + ... + 12744.
It is an arithmetic number, because the mean of its divisors is an integer number (104760).
22441064 is an apocalyptic number.
2441064 is a gapful number since it is divisible by the number (24) 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 2441064, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3352320).
2441064 is an abundant number, since it is smaller than the sum of its proper divisors (4263576).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2441064 is a wasteful number, since it uses less digits than its factorization.
2441064 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 250 (or 246 counting only the distinct ones).
The product of its (nonzero) digits is 768, while the sum is 21.
The square root of 2441064 is about 1562.3904761614. The cubic root of 2441064 is about 134.6458757346.
The spelling of 2441064 in words is "two million, four hundred forty-one thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •