Base | Representation |
---|---|
bin | 1010010100010001010000 |
3 | 12002101211100 |
4 | 22110101100 |
5 | 1143020324 |
6 | 133544400 |
7 | 31662510 |
oct | 12242120 |
9 | 5071740 |
10 | 2704464 |
11 | 15879a4 |
12 | aa5100 |
13 | 738c99 |
14 | 505840 |
15 | 3864c9 |
hex | 294450 |
2704464 has 60 divisors (see below), whose sum is σ = 8653216. Its totient is φ = 772416.
The previous prime is 2704451. The next prime is 2704469. The reversal of 2704464 is 4644072.
2704464 is digitally balanced in base 5, because in such base it contains all the possibile digits an equal number of times.
It is a nialpdrome in base 12.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2704469) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 334 + ... + 2349.
22704464 is an apocalyptic number.
2704464 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 2704464, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4326608).
2704464 is an abundant number, since it is smaller than the sum of its proper divisors (5948752).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2704464 is a wasteful number, since it uses less digits than its factorization.
2704464 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2704 (or 2695 counting only the distinct ones).
The product of its (nonzero) digits is 5376, while the sum is 27.
The square root of 2704464 is about 1644.5254634696. The cubic root of 2704464 is about 139.3243636898.
The spelling of 2704464 in words is "two million, seven hundred four thousand, four hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •