Base | Representation |
---|---|
bin | 1011010101010… |
… | …1101111110011 |
3 | 10022110010200210 |
4 | 2311111233303 |
5 | 44132142024 |
6 | 4414515203 |
7 | 1115026146 |
oct | 265255763 |
9 | 108403623 |
10 | 47537139 |
11 | 249193a1 |
12 | 13b05b03 |
13 | 9b053b0 |
14 | 645605d |
15 | 4290129 |
hex | 2d55bf3 |
47537139 has 8 divisors (see below), whose sum is σ = 68258512. Its totient is φ = 29253600.
The previous prime is 47537123. The next prime is 47537153. The reversal of 47537139 is 93173574.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 47537139 - 24 = 47537123 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (39), and also a Moran number because the ratio is a prime number: 1218901 = 47537139 / (4 + 7 + 5 + 3 + 7 + 1 + 3 + 9).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 47537097 and 47537106.
It is not an unprimeable number, because it can be changed into a prime (47537939) 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 7 ways as a sum of consecutive naturals, for example, 609412 + ... + 609489.
It is an arithmetic number, because the mean of its divisors is an integer number (8532314).
Almost surely, 247537139 is an apocalyptic number.
47537139 is a deficient number, since it is larger than the sum of its proper divisors (20721373).
47537139 is a wasteful number, since it uses less digits than its factorization.
47537139 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1218917.
The product of its digits is 79380, while the sum is 39.
The square root of 47537139 is about 6894.7181958366. The cubic root of 47537139 is about 362.2521848067.
The spelling of 47537139 in words is "forty-seven million, five hundred thirty-seven thousand, one hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •