Base | Representation |
---|---|
bin | 1011101011000… |
… | …1000000111101 |
3 | 10102010101212122 |
4 | 2322301000331 |
5 | 100013201144 |
6 | 4505212325 |
7 | 1133102132 |
oct | 272610075 |
9 | 112111778 |
10 | 48959549 |
11 | 25700041 |
12 | 144910a5 |
13 | a1b2962 |
14 | 6706589 |
15 | 44717ee |
hex | 2eb103d |
48959549 has 2 divisors, whose sum is σ = 48959550. Its totient is φ = 48959548.
The previous prime is 48959531. The next prime is 48959579. The reversal of 48959549 is 94595984.
48959549 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., 42016324 + 6943225 = 6482^2 + 2635^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-48959549 is a prime.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 48959549.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (48959579) 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, 24479774 + 24479775.
It is an arithmetic number, because the mean of its divisors is an integer number (24479775).
Almost surely, 248959549 is an apocalyptic number.
It is an amenable number.
48959549 is a deficient number, since it is larger than the sum of its proper divisors (1).
48959549 is an equidigital number, since it uses as much as digits as its factorization.
48959549 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2332800, while the sum is 53.
The square root of 48959549 is about 6997.1100462977. The cubic root of 48959549 is about 365.8298476510.
The spelling of 48959549 in words is "forty-eight million, nine hundred fifty-nine thousand, five hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •