Base | Representation |
---|---|
bin | 1011011100111… |
… | …0101101011101 |
3 | 10100101022100101 |
4 | 2313032231131 |
5 | 44244020410 |
6 | 4433301101 |
7 | 1122161515 |
oct | 267165535 |
9 | 110338311 |
10 | 48032605 |
11 | 25127675 |
12 | 14104791 |
13 | 9c49a7a |
14 | 6544845 |
15 | 433bd3a |
hex | 2dceb5d |
48032605 has 8 divisors (see below), whose sum is σ = 57714264. Its totient is φ = 38376000.
The previous prime is 48032597. The next prime is 48032629. The reversal of 48032605 is 50623084.
It can be written as a sum of positive squares in 4 ways, for example, as 5769604 + 42263001 = 2402^2 + 6501^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 48032605 - 23 = 48032597 is a prime.
It is a super-2 number, since 2×480326052 = 4614262286172050, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1746 + ... + 9955.
It is an arithmetic number, because the mean of its divisors is an integer number (7214283).
Almost surely, 248032605 is an apocalyptic number.
It is an amenable number.
48032605 is a deficient number, since it is larger than the sum of its proper divisors (9681659).
48032605 is a wasteful number, since it uses less digits than its factorization.
48032605 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12527.
The product of its (nonzero) digits is 5760, while the sum is 28.
The square root of 48032605 is about 6930.5558940102. Note that the first 3 decimals coincide. The cubic root of 48032605 is about 363.5063877428.
Adding to 48032605 its reverse (50623084), we get a palindrome (98655689).
The spelling of 48032605 in words is "forty-eight million, thirty-two thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •