Base | Representation |
---|---|
bin | 1011100000010… |
… | …0011010001101 |
3 | 10100210111001202 |
4 | 2320010122031 |
5 | 44323040212 |
6 | 4442115245 |
7 | 1124066003 |
oct | 270043215 |
9 | 110714052 |
10 | 48252557 |
11 | 25267951 |
12 | 141abb25 |
13 | 9cc5c12 |
14 | 65a0a73 |
15 | 43820c2 |
hex | 2e0468d |
48252557 has 4 divisors (see below), whose sum is σ = 48328476. Its totient is φ = 48176640.
The previous prime is 48252541. The next prime is 48252559. The reversal of 48252557 is 75525284.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 42367081 + 5885476 = 6509^2 + 2426^2 .
It is a cyclic number.
It is not a de Polignac number, because 48252557 - 24 = 48252541 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 48252557.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (48252559) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 36998 + ... + 38279.
It is an arithmetic number, because the mean of its divisors is an integer number (12082119).
Almost surely, 248252557 is an apocalyptic number.
It is an amenable number.
48252557 is a deficient number, since it is larger than the sum of its proper divisors (75919).
48252557 is an equidigital number, since it uses as much as digits as its factorization.
48252557 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 75918.
The product of its digits is 112000, while the sum is 38.
The square root of 48252557 is about 6946.4060491739. The cubic root of 48252557 is about 364.0604018631.
The spelling of 48252557 in words is "forty-eight million, two hundred fifty-two thousand, five hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •