Base | Representation |
---|---|
bin | 1011011000110… |
… | …1001010101001 |
3 | 10022212200002010 |
4 | 2312031022221 |
5 | 44211423022 |
6 | 4423430133 |
7 | 1116663021 |
oct | 266151251 |
9 | 108780063 |
10 | 47764137 |
11 | 24a639a3 |
12 | 13bb5349 |
13 | 9b84805 |
14 | 64b4a81 |
15 | 42d750c |
hex | 2d8d2a9 |
47764137 has 4 divisors (see below), whose sum is σ = 63685520. Its totient is φ = 31842756.
The previous prime is 47764109. The next prime is 47764163. The reversal of 47764137 is 73146774.
47764137 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 47764137 - 27 = 47764009 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 47764095 and 47764104.
It is not an unprimeable number, because it can be changed into a prime (47764177) 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 3 ways as a sum of consecutive naturals, for example, 7960687 + ... + 7960692.
It is an arithmetic number, because the mean of its divisors is an integer number (15921380).
Almost surely, 247764137 is an apocalyptic number.
It is an amenable number.
47764137 is a deficient number, since it is larger than the sum of its proper divisors (15921383).
47764137 is a wasteful number, since it uses less digits than its factorization.
47764137 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15921382.
The product of its digits is 98784, while the sum is 39.
The square root of 47764137 is about 6911.1603222614. The cubic root of 47764137 is about 362.8278748953.
The spelling of 47764137 in words is "forty-seven million, seven hundred sixty-four thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •