Search a number
-
+
48306132 = 2234719259
BaseRepresentation
bin1011100001000…
…1011111010100
310100220012120000
42320101133110
544331244012
64443211300
71124411130
oct270213724
9110805500
1048306132
11252a4126
1214216b30
13a014414
1465b63c0
154392ddc
hex2e117d4

48306132 has 180 divisors, whose sum is σ = 154899360. Its totient is φ = 12853728.

The previous prime is 48306131. The next prime is 48306133. The reversal of 48306132 is 23160384.

It is a happy number.

48306132 is a `hidden beast` number, since 48 + 3 + 0 + 613 + 2 = 666.

48306132 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is an interprime number because it is at equal distance from previous prime (48306131) and next prime (48306133).

It is a Harshad number since it is a multiple of its sum of digits (27).

It is a junction number, because it is equal to n+sod(n) for n = 48306096 and 48306105.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (48306131) 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 59 ways as a sum of consecutive naturals, for example, 818719 + ... + 818777.

It is an arithmetic number, because the mean of its divisors is an integer number (860552).

Almost surely, 248306132 is an apocalyptic number.

48306132 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 48306132, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (77449680).

48306132 is an abundant number, since it is smaller than the sum of its proper divisors (106593228).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

48306132 is a wasteful number, since it uses less digits than its factorization.

48306132 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 120 (or 90 counting only the distinct ones).

The product of its (nonzero) digits is 3456, while the sum is 27.

The square root of 48306132 is about 6950.2612900523. The cubic root of 48306132 is about 364.1950912491.

The spelling of 48306132 in words is "forty-eight million, three hundred six thousand, one hundred thirty-two".