Base | Representation |
---|---|
bin | 1011100100011… |
… | …1001101001101 |
3 | 10101022101101002 |
4 | 2321013031031 |
5 | 44410314112 |
6 | 4452030045 |
7 | 1126315451 |
oct | 271071515 |
9 | 111271332 |
10 | 48526157 |
11 | 25434469 |
12 | 14302325 |
13 | a090604 |
14 | 6632661 |
15 | 43d81c2 |
hex | 2e4734d |
48526157 has 12 divisors (see below), whose sum is σ = 50443488. Its totient is φ = 46662000.
The previous prime is 48526147. The next prime is 48526169. The reversal of 48526157 is 75162584.
It is not a de Polignac number, because 48526157 - 210 = 48525133 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 48526157.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (48526117) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 480407 + ... + 480507.
It is an arithmetic number, because the mean of its divisors is an integer number (4203624).
Almost surely, 248526157 is an apocalyptic number.
It is an amenable number.
48526157 is a deficient number, since it is larger than the sum of its proper divisors (1917331).
48526157 is an equidigital number, since it uses as much as digits as its factorization.
48526157 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 340 (or 239 counting only the distinct ones).
The product of its digits is 67200, while the sum is 38.
The square root of 48526157 is about 6966.0718486102. The cubic root of 48526157 is about 364.7471996920.
The spelling of 48526157 in words is "forty-eight million, five hundred twenty-six thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •