Base | Representation |
---|---|
bin | 1011100101100… |
… | …1010000000000 |
3 | 10101110010202101 |
4 | 2321121100000 |
5 | 44420200224 |
6 | 4453400144 |
7 | 1130044102 |
oct | 271312000 |
9 | 111403671 |
10 | 48600064 |
11 | 25484a47 |
12 | 14339054 |
13 | a0b8146 |
14 | 6651572 |
15 | 4400044 |
hex | 2e59400 |
48600064 has 44 divisors (see below), whose sum is σ = 100352128. Its totient is φ = 23500800.
The previous prime is 48600061. The next prime is 48600067. The reversal of 48600064 is 46000684.
48600064 is nontrivially palindromic in base 15.
It is an interprime number because it is at equal distance from previous prime (48600061) and next prime (48600067).
It is a zygodrome in base 15.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (48600061) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 30979 + ... + 32509.
Almost surely, 248600064 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 48600064, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (50176064).
48600064 is an abundant number, since it is smaller than the sum of its proper divisors (51752064).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
48600064 is a wasteful number, since it uses less digits than its factorization.
48600064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1582 (or 1564 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 28.
The square root of 48600064 is about 6971.3746133743. The cubic root of 48600064 is about 364.9322799240.
It can be divided in two parts, 4 and 8600064, that added together give a palindrome (8600068).
The spelling of 48600064 in words is "forty-eight million, six hundred thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •