Base | Representation |
---|---|
bin | 1011011110000… |
… | …0100010101101 |
3 | 10100112000112120 |
4 | 2313200202231 |
5 | 44303340040 |
6 | 4435023153 |
7 | 1122614460 |
oct | 267404255 |
9 | 110460476 |
10 | 48105645 |
11 | 25177535 |
12 | 1413aab9 |
13 | 9c740a3 |
14 | 65632d7 |
15 | 43537d0 |
hex | 2de08ad |
48105645 has 32 divisors (see below), whose sum is σ = 90808320. Its totient is φ = 21280320.
The previous prime is 48105643. The next prime is 48105647. The reversal of 48105645 is 54650184.
48105645 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 (48105643) and next prime (48105647).
It is not a de Polignac number, because 48105645 - 21 = 48105643 is a prime.
It is a super-3 number, since 3×481056453 (a number of 24 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (48105643) 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 31 ways as a sum of consecutive naturals, for example, 4135 + ... + 10644.
It is an arithmetic number, because the mean of its divisors is an integer number (2837760).
Almost surely, 248105645 is an apocalyptic number.
It is an amenable number.
48105645 is a deficient number, since it is larger than the sum of its proper divisors (42702675).
48105645 is a wasteful number, since it uses less digits than its factorization.
48105645 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14825.
The product of its (nonzero) digits is 19200, while the sum is 33.
The square root of 48105645 is about 6935.8233108983. The cubic root of 48105645 is about 363.6905477876.
The spelling of 48105645 in words is "forty-eight million, one hundred five thousand, six hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •