Base | Representation |
---|---|
bin | 1011011101110… |
… | …0010110100101 |
3 | 10100111011000000 |
4 | 2313130112211 |
5 | 44302312420 |
6 | 4434411513 |
7 | 1122513444 |
oct | 267342645 |
9 | 110434000 |
10 | 48088485 |
11 | 25165655 |
12 | 14130b99 |
13 | 9c69333 |
14 | 655ad5b |
15 | 434d690 |
hex | 2ddc5a5 |
48088485 has 56 divisors (see below), whose sum is σ = 88139520. Its totient is φ = 25170912.
The previous prime is 48088483. The next prime is 48088489. The reversal of 48088485 is 58488084.
It is a happy number.
It is not a de Polignac number, because 48088485 - 21 = 48088483 is a prime.
It is a super-3 number, since 3×480884853 (a number of 24 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a self number, because there is not a number n which added to its sum of digits gives 48088485.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (48088483) by changing a digit.
It is a polite number, since it can be written in 55 ways as a sum of consecutive naturals, for example, 287872 + ... + 288038.
It is an arithmetic number, because the mean of its divisors is an integer number (1573920).
Almost surely, 248088485 is an apocalyptic number.
48088485 is a gapful number since it is divisible by the number (45) formed by its first and last digit.
It is an amenable number.
48088485 is a deficient number, since it is larger than the sum of its proper divisors (40051035).
48088485 is an equidigital number, since it uses as much as digits as its factorization.
48088485 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 269 (or 254 counting only the distinct ones).
The product of its (nonzero) digits is 327680, while the sum is 45.
The square root of 48088485 is about 6934.5861448251. The cubic root of 48088485 is about 363.6472980329.
The spelling of 48088485 in words is "forty-eight million, eighty-eight thousand, four hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •