Base | Representation |
---|---|
bin | 10110100110010000000 |
3 | 1101121202012 |
4 | 2310302000 |
5 | 142143410 |
6 | 23512052 |
7 | 6202556 |
oct | 2646200 |
9 | 1347665 |
10 | 740480 |
11 | 466374 |
12 | 2b8628 |
13 | 1cc070 |
14 | 153bd6 |
15 | e9605 |
hex | b4c80 |
740480 has 64 divisors (see below), whose sum is σ = 1927800. Its totient is φ = 270336.
The previous prime is 740477. The next prime is 740483. The reversal of 740480 is 84047.
740480 = T331 + T332 + ... + T343.
It is an interprime number because it is at equal distance from previous prime (740477) and next prime (740483).
It can be written as a sum of positive squares in 4 ways, for example, as 341056 + 399424 = 584^2 + 632^2 .
It is a tau number, because it is divible by the number of its divisors (64).
It is not an unprimeable number, because it can be changed into a prime (740483) 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 7 ways as a sum of consecutive naturals, for example, 8276 + ... + 8364.
2740480 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 740480, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (963900).
740480 is an abundant number, since it is smaller than the sum of its proper divisors (1187320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
740480 is a wasteful number, since it uses less digits than its factorization.
740480 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 121 (or 109 counting only the distinct ones).
The product of its (nonzero) digits is 896, while the sum is 23.
The square root of 740480 is about 860.5114758096. The cubic root of 740480 is about 90.4699695850.
The spelling of 740480 in words is "seven hundred forty thousand, four hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •