Base | Representation |
---|---|
bin | 1011010000001… |
… | …0111010011000 |
3 | 10021210220021110 |
4 | 2310002322120 |
5 | 44040312343 |
6 | 4403340320 |
7 | 1112114025 |
oct | 264027230 |
9 | 107726243 |
10 | 47197848 |
11 | 24707495 |
12 | 139816a0 |
13 | 9a16b29 |
14 | 63a854c |
15 | 4224833 |
hex | 2d02e98 |
47197848 has 64 divisors (see below), whose sum is σ = 129276000. Its totient is φ = 14292992.
The previous prime is 47197837. The next prime is 47197849. The reversal of 47197848 is 84879174.
It is a super-2 number, since 2×471978482 = 4455273711662208, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 47197797 and 47197806.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (47197849) by changing a digit.
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, 9838 + ... + 13826.
Almost surely, 247197848 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 47197848, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (64638000).
47197848 is an abundant number, since it is smaller than the sum of its proper divisors (82078152).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
47197848 is a wasteful number, since it uses less digits than its factorization.
47197848 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4044 (or 4040 counting only the distinct ones).
The product of its digits is 451584, while the sum is 48.
The square root of 47197848 is about 6870.0689952867. The cubic root of 47197848 is about 361.3882814121.
The spelling of 47197848 in words is "forty-seven million, one hundred ninety-seven thousand, eight hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •