Base | Representation |
---|---|
bin | 1011011110111… |
… | …0000000000000 |
3 | 10100121211011011 |
4 | 2313232000000 |
5 | 44312121033 |
6 | 4440130304 |
7 | 1123234255 |
oct | 267560000 |
9 | 110554134 |
10 | 48160768 |
11 | 25204997 |
12 | 14166994 |
13 | 9c931c6 |
14 | 657942c |
15 | 4364ccd |
hex | 2dee000 |
48160768 has 28 divisors (see below), whose sum is σ = 96332040. Its totient is φ = 24076288.
The previous prime is 48160757. The next prime is 48160769. The reversal of 48160768 is 86706184.
It is a super-3 number, since 3×481607683 (a number of 24 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 48160768.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (48160769) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5253 + ... + 11131.
It is an arithmetic number, because the mean of its divisors is an integer number (3440430).
Almost surely, 248160768 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 48160768, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (48166020).
48160768 is an abundant number, since it is smaller than the sum of its proper divisors (48171272).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
48160768 is an frugal number, since it uses more digits than its factorization.
48160768 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5905 (or 5881 counting only the distinct ones).
The product of its (nonzero) digits is 64512, while the sum is 40.
The square root of 48160768 is about 6939.7959624185. The cubic root of 48160768 is about 363.8294092563.
The spelling of 48160768 in words is "forty-eight million, one hundred sixty thousand, seven hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •