Base | Representation |
---|---|
bin | 1011100011110… |
… | …0100100001101 |
3 | 10101020011120212 |
4 | 2320330210031 |
5 | 44402420243 |
6 | 4451052205 |
7 | 1126044416 |
oct | 270744415 |
9 | 111204525 |
10 | 48482573 |
11 | 25404747 |
12 | 142a1065 |
13 | a076819 |
14 | 662080d |
15 | 43ca318 |
hex | 2e3c90d |
48482573 has 2 divisors, whose sum is σ = 48482574. Its totient is φ = 48482572.
The previous prime is 48482527. The next prime is 48482579. The reversal of 48482573 is 37528484.
48482573 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 31326409 + 17156164 = 5597^2 + 4142^2 .
It is a cyclic number.
It is not a de Polignac number, because 48482573 - 210 = 48481549 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 48482573.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (48482579) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a good prime.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 24241286 + 24241287.
It is an arithmetic number, because the mean of its divisors is an integer number (24241287).
Almost surely, 248482573 is an apocalyptic number.
It is an amenable number.
48482573 is a deficient number, since it is larger than the sum of its proper divisors (1).
48482573 is an equidigital number, since it uses as much as digits as its factorization.
48482573 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 215040, while the sum is 41.
The square root of 48482573 is about 6962.9428404950. The cubic root of 48482573 is about 364.6379671689.
The spelling of 48482573 in words is "forty-eight million, four hundred eighty-two thousand, five hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •