Base | Representation |
---|---|
bin | 1011010000010… |
… | …0111010011000 |
3 | 10021211022111212 |
4 | 2310010322120 |
5 | 44041043130 |
6 | 4403442252 |
7 | 1112146640 |
oct | 264047230 |
9 | 107738455 |
10 | 47206040 |
11 | 24712662 |
12 | 13986388 |
13 | 9a1a78b |
14 | 63ab520 |
15 | 4226e95 |
hex | 2d04e98 |
47206040 has 64 divisors (see below), whose sum is σ = 123716160. Its totient is φ = 15874560.
The previous prime is 47206021. The next prime is 47206069. The reversal of 47206040 is 4060274.
It is a junction number, because it is equal to n+sod(n) for n = 47205997 and 47206015.
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, 13250 + ... + 16430.
It is an arithmetic number, because the mean of its divisors is an integer number (1933065).
Almost surely, 247206040 is an apocalyptic number.
47206040 is a gapful number since it is divisible by the number (40) 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 47206040, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (61858080).
47206040 is an abundant number, since it is smaller than the sum of its proper divisors (76510120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
47206040 is a wasteful number, since it uses less digits than its factorization.
47206040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3252 (or 3248 counting only the distinct ones).
The product of its (nonzero) digits is 1344, while the sum is 23.
The square root of 47206040 is about 6870.6651788600. The cubic root of 47206040 is about 361.4091885909.
The spelling of 47206040 in words is "forty-seven million, two hundred six thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •