Base | Representation |
---|---|
bin | 1011010111101… |
… | …0111110111000 |
3 | 10022201212220120 |
4 | 2311322332320 |
5 | 44202032111 |
6 | 4422053240 |
7 | 1116232620 |
oct | 265727670 |
9 | 108655816 |
10 | 47689656 |
11 | 24a12a43 |
12 | 13b7a220 |
13 | 9b59941 |
14 | 6495880 |
15 | 42c0406 |
hex | 2d7afb8 |
47689656 has 64 divisors (see below), whose sum is σ = 140666880. Its totient is φ = 13184640.
The previous prime is 47689651. The next prime is 47689657. The reversal of 47689656 is 65698674.
It is a junction number, because it is equal to n+sod(n) for n = 47689599 and 47689608.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (47689651) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 630 + ... + 9786.
It is an arithmetic number, because the mean of its divisors is an integer number (2197920).
Almost surely, 247689656 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 47689656, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (70333440).
47689656 is an abundant number, since it is smaller than the sum of its proper divisors (92977224).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
47689656 is a wasteful number, since it uses less digits than its factorization.
47689656 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9204 (or 9200 counting only the distinct ones).
The product of its digits is 2177280, while the sum is 51.
The square root of 47689656 is about 6905.7697615834. The cubic root of 47689656 is about 362.6391849190.
The spelling of 47689656 in words is "forty-seven million, six hundred eighty-nine thousand, six hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •