Base | Representation |
---|---|
bin | 1011100100001… |
… | …0011111100001 |
3 | 10101021101212222 |
4 | 2321002133201 |
5 | 44404204344 |
6 | 4451400425 |
7 | 1126205246 |
oct | 271023741 |
9 | 111241788 |
10 | 48506849 |
11 | 25420a06 |
12 | 142b3115 |
13 | a0848a1 |
14 | 66295cd |
15 | 43d25ee |
hex | 2e427e1 |
48506849 has 2 divisors, whose sum is σ = 48506850. Its totient is φ = 48506848.
The previous prime is 48506837. The next prime is 48506851. The reversal of 48506849 is 94860584.
It is a happy number.
48506849 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., 47018449 + 1488400 = 6857^2 + 1220^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-48506849 is a prime.
Together with 48506851, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (48506749) 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, 24253424 + 24253425.
It is an arithmetic number, because the mean of its divisors is an integer number (24253425).
Almost surely, 248506849 is an apocalyptic number.
It is an amenable number.
48506849 is a deficient number, since it is larger than the sum of its proper divisors (1).
48506849 is an equidigital number, since it uses as much as digits as its factorization.
48506849 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 276480, while the sum is 44.
The square root of 48506849 is about 6964.6858507760. The cubic root of 48506849 is about 364.6988170353.
The spelling of 48506849 in words is "forty-eight million, five hundred six thousand, eight hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •