Base | Representation |
---|---|
bin | 1011011110000… |
… | …0001001001111 |
3 | 10100111221022012 |
4 | 2313200021033 |
5 | 44303312030 |
6 | 4435011435 |
7 | 1122606641 |
oct | 267401117 |
9 | 110457265 |
10 | 48104015 |
11 | 25176293 |
12 | 14139b7b |
13 | 9c7341b |
14 | 6562891 |
15 | 4353095 |
hex | 2de024f |
48104015 has 16 divisors (see below), whose sum is σ = 58563648. Its totient is φ = 37929216.
The previous prime is 48104003. The next prime is 48104027. The reversal of 48104015 is 51040184.
48104015 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 (48104003) and next prime (48104027).
It is a cyclic number.
It is not a de Polignac number, because 48104015 - 210 = 48102991 is a prime.
It is a super-3 number, since 3×481040153 (a number of 24 digits) contains 333 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 (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 182774 + ... + 183036.
It is an arithmetic number, because the mean of its divisors is an integer number (3660228).
Almost surely, 248104015 is an apocalyptic number.
48104015 is a deficient number, since it is larger than the sum of its proper divisors (10459633).
48104015 is a wasteful number, since it uses less digits than its factorization.
48104015 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 658.
The product of its (nonzero) digits is 640, while the sum is 23.
The square root of 48104015 is about 6935.7058040260. The cubic root of 48104015 is about 363.6864400071.
Adding to 48104015 its reverse (51040184), we get a palindrome (99144199).
The spelling of 48104015 in words is "forty-eight million, one hundred four thousand, fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •