Base | Representation |
---|---|
bin | 1011010101000… |
… | …0101111100001 |
3 | 10022102002120121 |
4 | 2311100233201 |
5 | 44131013031 |
6 | 4414240241 |
7 | 1114612324 |
oct | 265205741 |
9 | 108362517 |
10 | 47516641 |
11 | 24904a57 |
12 | 13ab6081 |
13 | 9ac8c73 |
14 | 644c7bb |
15 | 4289011 |
hex | 2d50be1 |
47516641 has 2 divisors, whose sum is σ = 47516642. Its totient is φ = 47516640.
The previous prime is 47516639. The next prime is 47516647. The reversal of 47516641 is 14661574.
47516641 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 38937600 + 8579041 = 6240^2 + 2929^2 .
It is a cyclic number.
It is not a de Polignac number, because 47516641 - 21 = 47516639 is a prime.
Together with 47516639, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 47516597 and 47516606.
It is not a weakly prime, because it can be changed into another prime (47516647) 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 as a sum of consecutive naturals, namely, 23758320 + 23758321.
It is an arithmetic number, because the mean of its divisors is an integer number (23758321).
Almost surely, 247516641 is an apocalyptic number.
It is an amenable number.
47516641 is a deficient number, since it is larger than the sum of its proper divisors (1).
47516641 is an equidigital number, since it uses as much as digits as its factorization.
47516641 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 20160, while the sum is 34.
The square root of 47516641 is about 6893.2315353541. The cubic root of 47516641 is about 362.2001096434.
The spelling of 47516641 in words is "forty-seven million, five hundred sixteen thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •