Base | Representation |
---|---|
bin | 1011010100101… |
… | …1000110100101 |
3 | 10022100220220001 |
4 | 2311023012211 |
5 | 44124243131 |
6 | 4413541301 |
7 | 1114455064 |
oct | 265130645 |
9 | 108326801 |
10 | 47493541 |
11 | 24899667 |
12 | 13aa4831 |
13 | 9abb5b4 |
14 | 64441db |
15 | 4282261 |
hex | 2d4b1a5 |
47493541 has 2 divisors, whose sum is σ = 47493542. Its totient is φ = 47493540.
The previous prime is 47493527. The next prime is 47493557. The reversal of 47493541 is 14539474.
47493541 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., 39112516 + 8381025 = 6254^2 + 2895^2 .
It is a cyclic number.
It is not a de Polignac number, because 47493541 - 29 = 47493029 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 47493541.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (47493571) 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, 23746770 + 23746771.
It is an arithmetic number, because the mean of its divisors is an integer number (23746771).
Almost surely, 247493541 is an apocalyptic number.
It is an amenable number.
47493541 is a deficient number, since it is larger than the sum of its proper divisors (1).
47493541 is an equidigital number, since it uses as much as digits as its factorization.
47493541 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 60480, while the sum is 37.
The square root of 47493541 is about 6891.5557750047. Note that the first 3 decimals coincide. The cubic root of 47493541 is about 362.1414061482.
The spelling of 47493541 in words is "forty-seven million, four hundred ninety-three thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •