Base | Representation |
---|---|
bin | 1011001101010… |
… | …0000110000000 |
3 | 10021110011012221 |
4 | 2303110012000 |
5 | 44013143310 |
6 | 4355300424 |
7 | 1110354652 |
oct | 263240600 |
9 | 107404187 |
10 | 47006080 |
11 | 24596400 |
12 | 138aa714 |
13 | 997a764 |
14 | 63586d2 |
15 | 41d7ada |
hex | 2cd4180 |
47006080 has 96 divisors (see below), whose sum is σ = 123721920. Its totient is φ = 17064960.
The previous prime is 47006059. The next prime is 47006083. The reversal of 47006080 is 8060074.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (47006083) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 77137 + ... + 77743.
It is an arithmetic number, because the mean of its divisors is an integer number (1288770).
Almost surely, 247006080 is an apocalyptic number.
47006080 is a gapful number since it is divisible by the number (40) 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 47006080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (61860960).
47006080 is an abundant number, since it is smaller than the sum of its proper divisors (76715840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
47006080 is a wasteful number, since it uses less digits than its factorization.
47006080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 648 (or 625 counting only the distinct ones).
The product of its (nonzero) digits is 1344, while the sum is 25.
The square root of 47006080 is about 6856.0980156354. The cubic root of 47006080 is about 360.8981688057.
Subtracting from 47006080 its product of nonzero digits (1344), we obtain a square (47004736 = 68562).
The spelling of 47006080 in words is "forty-seven million, six thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •