Base | Representation |
---|---|
bin | 1011011110000… |
… | …0011000111001 |
3 | 10100111222200022 |
4 | 2313200120321 |
5 | 44303330032 |
6 | 4435020225 |
7 | 1122612602 |
oct | 267403071 |
9 | 110458608 |
10 | 48105017 |
11 | 25177014 |
12 | 1413a675 |
13 | 9c73a0c |
14 | 6562da9 |
15 | 4353512 |
hex | 2de0639 |
48105017 has 16 divisors (see below), whose sum is σ = 52316160. Its totient is φ = 44086032.
The previous prime is 48105011. The next prime is 48105061. The reversal of 48105017 is 71050184.
48105017 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 48105017 - 214 = 48088633 is a prime.
It is a super-3 number, since 3×481050173 (a number of 24 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (48105011) 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 15 ways as a sum of consecutive naturals, for example, 91718 + ... + 92240.
It is an arithmetic number, because the mean of its divisors is an integer number (3269760).
Almost surely, 248105017 is an apocalyptic number.
48105017 is a gapful number since it is divisible by the number (47) formed by its first and last digit.
It is an amenable number.
48105017 is a deficient number, since it is larger than the sum of its proper divisors (4211143).
48105017 is a wasteful number, since it uses less digits than its factorization.
48105017 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 692.
The product of its (nonzero) digits is 1120, while the sum is 26.
The square root of 48105017 is about 6935.7780385477. The cubic root of 48105017 is about 363.6889651690.
The spelling of 48105017 in words is "forty-eight million, one hundred five thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •