Base | Representation |
---|---|
bin | 1011010000000… |
… | …1110101000000 |
3 | 10021210200012000 |
4 | 2310001311000 |
5 | 44040142113 |
6 | 4403304000 |
7 | 1112065053 |
oct | 264016500 |
9 | 107720160 |
10 | 47193408 |
11 | 24704119 |
12 | 1397b000 |
13 | 9a14ac2 |
14 | 63a6a9a |
15 | 4223373 |
hex | 2d01d40 |
47193408 has 112 divisors (see below), whose sum is σ = 143377920. Its totient is φ = 15206400.
The previous prime is 47193379. The next prime is 47193409. The reversal of 47193408 is 80439174.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (47193409) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 53128 + ... + 54008.
It is an arithmetic number, because the mean of its divisors is an integer number (1280160).
Almost surely, 247193408 is an apocalyptic number.
47193408 is a gapful number since it is divisible by the number (48) 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 47193408, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (71688960).
47193408 is an abundant number, since it is smaller than the sum of its proper divisors (96184512).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
47193408 is a wasteful number, since it uses less digits than its factorization.
47193408 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 933 (or 917 counting only the distinct ones).
The product of its (nonzero) digits is 24192, while the sum is 36.
The square root of 47193408 is about 6869.7458468272. The cubic root of 47193408 is about 361.3769488736.
The spelling of 47193408 in words is "forty-seven million, one hundred ninety-three thousand, four hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •