Base | Representation |
---|---|
bin | 1011001101010… |
… | …10001110000000 |
3 | 20112220201212000 |
4 | 11212222032000 |
5 | 143032123410 |
6 | 13155104000 |
7 | 2221106121 |
oct | 546521600 |
9 | 215821760 |
10 | 94020480 |
11 | 49087a84 |
12 | 275a2000 |
13 | 1662bc28 |
14 | c6b6048 |
15 | 83c2dc0 |
hex | 59aa380 |
94020480 has 128 divisors (see below), whose sum is σ = 333050400. Its totient is φ = 25067520.
The previous prime is 94020439. The next prime is 94020517. The reversal of 94020480 is 8402049.
It is a tau number, because it is divible by the number of its divisors (128).
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
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, 14560 + ... + 20000.
Almost surely, 294020480 is an apocalyptic number.
94020480 is a gapful number since it is divisible by the number (90) 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 94020480, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (166525200).
94020480 is an abundant number, since it is smaller than the sum of its proper divisors (239029920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
94020480 is a wasteful number, since it uses less digits than its factorization.
94020480 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5469 (or 5451 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 27.
The square root of 94020480 is about 9696.4158326672. The cubic root of 94020480 is about 454.7166129728.
The spelling of 94020480 in words is "ninety-four million, twenty thousand, four hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •