Base | Representation |
---|---|
bin | 1011100001100… |
… | …0110100010001 |
3 | 10100221201201121 |
4 | 2320120310101 |
5 | 44333224040 |
6 | 4444002241 |
7 | 1124564464 |
oct | 270306421 |
9 | 110851647 |
10 | 48336145 |
11 | 25314730 |
12 | 14230381 |
13 | a024c90 |
14 | 65c32db |
15 | 439bc4a |
hex | 2e18d11 |
48336145 has 32 divisors (see below), whose sum is σ = 69229440. Its totient is φ = 31933440.
The previous prime is 48336143. The next prime is 48336181. The reversal of 48336145 is 54163384.
It is a happy number.
It is not a de Polignac number, because 48336145 - 21 = 48336143 is a prime.
It is a super-2 number, since 2×483361452 = 4672765826922050, which contains 22 as substring.
It is a Smith number, since the sum of its digits (34) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a self number, because there is not a number n which added to its sum of digits gives 48336145.
It is not an unprimeable number, because it can be changed into a prime (48336143) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 47401 + ... + 48409.
It is an arithmetic number, because the mean of its divisors is an integer number (2163420).
Almost surely, 248336145 is an apocalyptic number.
It is an amenable number.
48336145 is a deficient number, since it is larger than the sum of its proper divisors (20893295).
48336145 is a wasteful number, since it uses less digits than its factorization.
48336145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1105.
The product of its digits is 34560, while the sum is 34.
The square root of 48336145 is about 6952.4200822447. The cubic root of 48336145 is about 364.2705014427.
The spelling of 48336145 in words is "forty-eight million, three hundred thirty-six thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •