Base | Representation |
---|---|
bin | 1011100011000… |
… | …0001111111000 |
3 | 10101010121101020 |
4 | 2320300033320 |
5 | 44344311440 |
6 | 4450022440 |
7 | 1125444342 |
oct | 270601770 |
9 | 111117336 |
10 | 48432120 |
11 | 2537a850 |
12 | 14277a20 |
13 | a059879 |
14 | 660a292 |
15 | 43ba3d0 |
hex | 2e303f8 |
48432120 has 64 divisors (see below), whose sum is σ = 158509440. Its totient is φ = 11740800.
The previous prime is 48432119. The next prime is 48432127. The reversal of 48432120 is 2123484.
48432120 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (48432127) 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, 17026 + ... + 19665.
It is an arithmetic number, because the mean of its divisors is an integer number (2476710).
Almost surely, 248432120 is an apocalyptic number.
48432120 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
48432120 is an abundant number, since it is smaller than the sum of its proper divisors (110077320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
48432120 is a wasteful number, since it uses less digits than its factorization.
48432120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36716 (or 36712 counting only the distinct ones).
The product of its (nonzero) digits is 1536, while the sum is 24.
The square root of 48432120 is about 6959.3189321944. The cubic root of 48432120 is about 364.5114374112.
The spelling of 48432120 in words is "forty-eight million, four hundred thirty-two thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •