Base | Representation |
---|---|
bin | 1011010010100… |
… | …0110011001000 |
3 | 10022002210011000 |
4 | 2310220303020 |
5 | 44110244112 |
6 | 4410535000 |
7 | 1113331326 |
oct | 264506310 |
9 | 108083130 |
10 | 47353032 |
11 | 24803041 |
12 | 13a37460 |
13 | 9a6c65c |
14 | 6408d16 |
15 | 42557dc |
hex | 2d28cc8 |
47353032 has 64 divisors (see below), whose sum is σ = 134769600. Its totient is φ = 15396480.
The previous prime is 47353013. The next prime is 47353043. The reversal of 47353032 is 23035374.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 47352987 and 47353005.
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, 6183 + ... + 11529.
It is an arithmetic number, because the mean of its divisors is an integer number (2105775).
Almost surely, 247353032 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 47353032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (67384800).
47353032 is an abundant number, since it is smaller than the sum of its proper divisors (87416568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
47353032 is a wasteful number, since it uses less digits than its factorization.
47353032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5403 (or 5393 counting only the distinct ones).
The product of its (nonzero) digits is 7560, while the sum is 27.
The square root of 47353032 is about 6881.3539365448. The cubic root of 47353032 is about 361.7839232259.
The spelling of 47353032 in words is "forty-seven million, three hundred fifty-three thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •