Base | Representation |
---|---|
bin | 1011010000100… |
… | …1001110000000 |
3 | 10021212012201012 |
4 | 2310021032000 |
5 | 44042124210 |
6 | 4404100052 |
7 | 1112252240 |
oct | 264111600 |
9 | 107765635 |
10 | 47223680 |
11 | 24724939 |
12 | 13994628 |
13 | 9a2580a |
14 | 63b3b20 |
15 | 422c305 |
hex | 2d09380 |
47223680 has 128 divisors (see below), whose sum is σ = 131604480. Its totient is φ = 15869952.
The previous prime is 47223679. The next prime is 47223691. The reversal of 47223680 is 8632274.
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 (32).
It is a congruent number.
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, 371777 + ... + 371903.
It is an arithmetic number, because the mean of its divisors is an integer number (1028160).
Almost surely, 247223680 is an apocalyptic number.
47223680 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 47223680, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (65802240).
47223680 is an abundant number, since it is smaller than the sum of its proper divisors (84380800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
47223680 is a wasteful number, since it uses less digits than its factorization.
47223680 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 236 (or 224 counting only the distinct ones).
The product of its (nonzero) digits is 16128, while the sum is 32.
The square root of 47223680 is about 6871.9487774575. The cubic root of 47223680 is about 361.4542002331.
The spelling of 47223680 in words is "forty-seven million, two hundred twenty-three thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •