Search a number
-
+
48505632 = 25371929131
BaseRepresentation
bin1011100100001…
…0001100100000
310101021100012220
42321002030200
544404140012
64451351040
71126201560
oct271021440
9111240186
1048505632
112541aaaa
12142b2480
13a084176
146628da0
1543d208c
hex2e42320

48505632 has 192 divisors, whose sum is σ = 159667200. Its totient is φ = 12579840.

The previous prime is 48505627. The next prime is 48505649. The reversal of 48505632 is 23650584.

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

It is an unprimeable number.

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 370207 + ... + 370337.

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

Almost surely, 248505632 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 28800, while the sum is 33.

The square root of 48505632 is about 6964.5984808889. The cubic root of 48505632 is about 364.6957670043.

The spelling of 48505632 in words is "forty-eight million, five hundred five thousand, six hundred thirty-two".