Base | Representation |
---|---|
bin | 1011010100100… |
… | …1000001111101 |
3 | 10022100111020200 |
4 | 2311021001331 |
5 | 44124010203 |
6 | 4413434113 |
7 | 1114421250 |
oct | 265110175 |
9 | 108314220 |
10 | 47485053 |
11 | 24893250 |
12 | 13a9b939 |
13 | 9ab7785 |
14 | 6441097 |
15 | 427e9a3 |
hex | 2d4907d |
47485053 has 24 divisors (see below), whose sum is σ = 85515456. Its totient is φ = 24667200.
The previous prime is 47485043. The next prime is 47485057. The reversal of 47485053 is 35058474.
47485053 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 47485053 - 24 = 47485037 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 47484999 and 47485017.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (47485057) 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 23 ways as a sum of consecutive naturals, for example, 33568 + ... + 34953.
It is an arithmetic number, because the mean of its divisors is an integer number (3563144).
Almost surely, 247485053 is an apocalyptic number.
It is an amenable number.
47485053 is a deficient number, since it is larger than the sum of its proper divisors (38030403).
47485053 is a wasteful number, since it uses less digits than its factorization.
47485053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68545 (or 68542 counting only the distinct ones).
The product of its (nonzero) digits is 67200, while the sum is 36.
The square root of 47485053 is about 6890.9399213750. The cubic root of 47485053 is about 362.1198310081.
It can be divided in two parts, 4748 and 5053, that added together give a square (9801 = 992).
The spelling of 47485053 in words is "forty-seven million, four hundred eighty-five thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •