Base | Representation |
---|---|
bin | 1011010110111… |
… | …0110111110111 |
3 | 10022122100212111 |
4 | 2311232313313 |
5 | 44143440210 |
6 | 4421031451 |
7 | 1115635201 |
oct | 265566767 |
9 | 108570774 |
10 | 47640055 |
11 | 24989751 |
12 | 13b55587 |
13 | 9b401a8 |
14 | 6481771 |
15 | 42b088a |
hex | 2d6edf7 |
47640055 has 4 divisors (see below), whose sum is σ = 57168072. Its totient is φ = 38112040.
The previous prime is 47640037. The next prime is 47640059. The reversal of 47640055 is 55004674.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 47640055 - 25 = 47640023 is a prime.
It is a Smith number, since the sum of its digits (31) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 47639999 and 47640026.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (47640059) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4764001 + ... + 4764010.
It is an arithmetic number, because the mean of its divisors is an integer number (14292018).
Almost surely, 247640055 is an apocalyptic number.
47640055 is a deficient number, since it is larger than the sum of its proper divisors (9528017).
47640055 is an equidigital number, since it uses as much as digits as its factorization.
47640055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9528016.
The product of its (nonzero) digits is 16800, while the sum is 31.
The square root of 47640055 is about 6902.1775549460. The cubic root of 47640055 is about 362.5134168637.
The spelling of 47640055 in words is "forty-seven million, six hundred forty thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •