Base | Representation |
---|---|
bin | 1011010011101… |
… | …0100001100101 |
3 | 10022020110202002 |
4 | 2310322201211 |
5 | 44120110022 |
6 | 4412255045 |
7 | 1114053110 |
oct | 264724145 |
9 | 108213662 |
10 | 47425637 |
11 | 24852646 |
12 | 13a71485 |
13 | 9a9670c |
14 | 6427577 |
15 | 426c092 |
hex | 2d3a865 |
47425637 has 8 divisors (see below), whose sum is σ = 54286656. Its totient is φ = 40586112.
The previous prime is 47425613. The next prime is 47425663. The reversal of 47425637 is 73652474.
47425637 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 47425637 - 212 = 47421541 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 47425637.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (47425607) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 323 + ... + 9744.
It is an arithmetic number, because the mean of its divisors is an integer number (6785832).
Almost surely, 247425637 is an apocalyptic number.
It is an amenable number.
47425637 is a deficient number, since it is larger than the sum of its proper divisors (6861019).
47425637 is a wasteful number, since it uses less digits than its factorization.
47425637 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10747.
The product of its digits is 141120, while the sum is 38.
The square root of 47425637 is about 6886.6274038894. The cubic root of 47425637 is about 361.9687329913.
The spelling of 47425637 in words is "forty-seven million, four hundred twenty-five thousand, six hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •