Base | Representation |
---|---|
bin | 1011011101001… |
… | …1111101110100 |
3 | 10100102101212200 |
4 | 2313103331310 |
5 | 44300213012 |
6 | 4433544500 |
7 | 1122311340 |
oct | 267237564 |
9 | 110371780 |
10 | 48054132 |
11 | 25141865 |
12 | 14115130 |
13 | 9c567c9 |
14 | 654c620 |
15 | 43433dc |
hex | 2dd3f74 |
48054132 has 72 divisors (see below), whose sum is σ = 142239552. Its totient is φ = 13392000.
The previous prime is 48054119. The next prime is 48054187. The reversal of 48054132 is 23145084.
48054132 is a `hidden beast` number, since 480 + 54 + 132 = 666.
It is a junction number, because it is equal to n+sod(n) for n = 48054096 and 48054105.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 8007 + ... + 12657.
Almost surely, 248054132 is an apocalyptic number.
48054132 is a gapful number since it is divisible by the number (42) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 48054132, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (71119776).
48054132 is an abundant number, since it is smaller than the sum of its proper divisors (94185420).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
48054132 is a wasteful number, since it uses less digits than its factorization.
48054132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4709 (or 4704 counting only the distinct ones).
The product of its (nonzero) digits is 3840, while the sum is 27.
The square root of 48054132 is about 6932.1087700641. The cubic root of 48054132 is about 363.5606844251.
The spelling of 48054132 in words is "forty-eight million, fifty-four thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •