Base | Representation |
---|---|
bin | 1011010111011… |
… | …0000000000000 |
3 | 10022200211220201 |
4 | 2311312000000 |
5 | 44200403443 |
6 | 4421414544 |
7 | 1116116254 |
oct | 265660000 |
9 | 108624821 |
10 | 47669248 |
11 | 249a9680 |
12 | 13b6a454 |
13 | 9b50573 |
14 | 648c264 |
15 | 42b934d |
hex | 2d76000 |
47669248 has 84 divisors (see below), whose sum is σ = 108717588. Its totient is φ = 20725760.
The previous prime is 47669231. The next prime is 47669257. The reversal of 47669248 is 84296674.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (46).
Its product of digits (580608) is a multiple of the sum of its prime divisors (36).
It is a junction number, because it is equal to n+sod(n) for n = 47669198 and 47669207.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 2072565 + ... + 2072587.
It is an arithmetic number, because the mean of its divisors is an integer number (1294257).
Almost surely, 247669248 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 47669248, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (54358794).
47669248 is an abundant number, since it is smaller than the sum of its proper divisors (61048340).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
47669248 is an equidigital number, since it uses as much as digits as its factorization.
47669248 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 83 (or 36 counting only the distinct ones).
The product of its digits is 580608, while the sum is 46.
The square root of 47669248 is about 6904.2919984601. The cubic root of 47669248 is about 362.5874490568.
The spelling of 47669248 in words is "forty-seven million, six hundred sixty-nine thousand, two hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •