Base | Representation |
---|---|
bin | 1011011010111… |
… | …1100101000000 |
3 | 10100010211102112 |
4 | 2312233211000 |
5 | 44230430323 |
6 | 4430434452 |
7 | 1121120660 |
oct | 266574500 |
9 | 110124375 |
10 | 47905088 |
11 | 2504a890 |
12 | 14062a28 |
13 | 9c03a0a |
14 | 65101a0 |
15 | 4314178 |
hex | 2daf940 |
47905088 has 56 divisors (see below), whose sum is σ = 118530624. Its totient is φ = 18662400.
The previous prime is 47905087. The next prime is 47905093. The reversal of 47905088 is 88050974.
47905088 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (56).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (47905087) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 68 + ... + 9788.
Almost surely, 247905088 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 47905088, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (59265312).
47905088 is an abundant number, since it is smaller than the sum of its proper divisors (70625536).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
47905088 is a wasteful number, since it uses less digits than its factorization.
47905088 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9751 (or 9741 counting only the distinct ones).
The product of its (nonzero) digits is 80640, while the sum is 41.
The square root of 47905088 is about 6921.3501573031. The cubic root of 47905088 is about 363.1844236368.
The spelling of 47905088 in words is "forty-seven million, nine hundred five thousand, eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •