Base | Representation |
---|---|
bin | 1011100100110… |
… | …1100000110101 |
3 | 10101100200210211 |
4 | 2321031200311 |
5 | 44412130424 |
6 | 4452345421 |
7 | 1126453663 |
oct | 271154065 |
9 | 111320724 |
10 | 48551989 |
11 | 25451912 |
12 | 14315271 |
13 | a09c2b5 |
14 | 663bc33 |
15 | 43e0b94 |
hex | 2e4d835 |
48551989 has 2 divisors, whose sum is σ = 48551990. Its totient is φ = 48551988.
The previous prime is 48551977. The next prime is 48552041. The reversal of 48551989 is 98915584.
48551989 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., 44328964 + 4223025 = 6658^2 + 2055^2 .
It is a cyclic number.
It is not a de Polignac number, because 48551989 - 25 = 48551957 is a prime.
It is a super-2 number, since 2×485519892 = 4714591271712242, which contains 22 as substring.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (48551189) 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, 24275994 + 24275995.
It is an arithmetic number, because the mean of its divisors is an integer number (24275995).
Almost surely, 248551989 is an apocalyptic number.
It is an amenable number.
48551989 is a deficient number, since it is larger than the sum of its proper divisors (1).
48551989 is an equidigital number, since it uses as much as digits as its factorization.
48551989 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 518400, while the sum is 49.
The square root of 48551989 is about 6967.9257315215. The cubic root of 48551989 is about 364.8119103473.
The spelling of 48551989 in words is "forty-eight million, five hundred fifty-one thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •