Base | Representation |
---|---|
bin | 1011011000111… |
… | …1000110001001 |
3 | 10022220001220212 |
4 | 2312033012021 |
5 | 44212201131 |
6 | 4423530505 |
7 | 1120025042 |
oct | 266170611 |
9 | 108801825 |
10 | 47772041 |
11 | 24a69929 |
12 | 13bb9a35 |
13 | 9b882a5 |
14 | 64b78c9 |
15 | 42d9a2b |
hex | 2d8f189 |
47772041 has 2 divisors, whose sum is σ = 47772042. Its totient is φ = 47772040.
The previous prime is 47772029. The next prime is 47772059. The reversal of 47772041 is 14027774.
47772041 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., 40589641 + 7182400 = 6371^2 + 2680^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-47772041 is a prime.
It is a Sophie Germain prime.
It is a Chen prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 47771989 and 47772007.
It is not a weakly prime, because it can be changed into another prime (47772071) 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, 23886020 + 23886021.
It is an arithmetic number, because the mean of its divisors is an integer number (23886021).
Almost surely, 247772041 is an apocalyptic number.
It is an amenable number.
47772041 is a deficient number, since it is larger than the sum of its proper divisors (1).
47772041 is an equidigital number, since it uses as much as digits as its factorization.
47772041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10976, while the sum is 32.
The square root of 47772041 is about 6911.7321273325. The cubic root of 47772041 is about 362.8478873533.
The spelling of 47772041 in words is "forty-seven million, seven hundred seventy-two thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •