Base | Representation |
---|---|
bin | 1011100110010… |
… | …1001100010011 |
3 | 10101112121212001 |
4 | 2321211030103 |
5 | 44423231404 |
6 | 4454414431 |
7 | 1130336521 |
oct | 271451423 |
9 | 111477761 |
10 | 48648979 |
11 | 25508775 |
12 | 14361417 |
13 | a1044a2 |
14 | 6665311 |
15 | 440e7a4 |
hex | 2e65313 |
48648979 has 8 divisors (see below), whose sum is σ = 52515360. Its totient is φ = 44928576.
The previous prime is 48648967. The next prime is 48648991. The reversal of 48648979 is 97984684.
48648979 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (48648967) and next prime (48648991).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 48648979 - 27 = 48648851 is a prime.
It is a Duffinian number.
It is a nialpdrome in base 14.
It is not an unprimeable number, because it can be changed into a prime (48648959) 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 in 7 ways as a sum of consecutive naturals, for example, 35802 + ... + 37135.
It is an arithmetic number, because the mean of its divisors is an integer number (6564420).
Almost surely, 248648979 is an apocalyptic number.
48648979 is a deficient number, since it is larger than the sum of its proper divisors (3866381).
48648979 is a wasteful number, since it uses less digits than its factorization.
48648979 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 72989.
The product of its digits is 3483648, while the sum is 55.
The square root of 48648979 is about 6974.8820061704. The cubic root of 48648979 is about 365.0546712377.
The spelling of 48648979 in words is "forty-eight million, six hundred forty-eight thousand, nine hundred seventy-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •