Base | Representation |
---|---|
bin | 1011011100010… |
… | …0011010100101 |
3 | 10100022011111121 |
4 | 2313010122211 |
5 | 44241143222 |
6 | 4432333541 |
7 | 1121624545 |
oct | 267043245 |
9 | 110264447 |
10 | 47990437 |
11 | 250a8a20 |
12 | 140a42b1 |
13 | 9c33811 |
14 | 6533325 |
15 | 432e5c7 |
hex | 2dc46a5 |
47990437 has 8 divisors (see below), whose sum is σ = 52647840. Its totient is φ = 43382160.
The previous prime is 47990417. The next prime is 47990461. The reversal of 47990437 is 73409974.
It is a happy number.
47990437 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 a cyclic number.
It is not a de Polignac number, because 47990437 - 211 = 47988389 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 47990393 and 47990402.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (47990417) 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, 10218 + ... + 14155.
It is an arithmetic number, because the mean of its divisors is an integer number (6580980).
Almost surely, 247990437 is an apocalyptic number.
It is an amenable number.
47990437 is a deficient number, since it is larger than the sum of its proper divisors (4657403).
47990437 is a wasteful number, since it uses less digits than its factorization.
47990437 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24563.
The product of its (nonzero) digits is 190512, while the sum is 43.
The square root of 47990437 is about 6927.5130458195. The cubic root of 47990437 is about 363.3999820687.
The spelling of 47990437 in words is "forty-seven million, nine hundred ninety thousand, four hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •