Search a number
-
+
48548562 = 238091427
BaseRepresentation
bin1011100100110…
…0101011010010
310101100112002220
42321030223102
544412023222
64452321510
71126440666
oct271145322
9111315086
1048548562
112544a287
1214313296
13a09a87a
14663a8a6
1543deb5c
hex2e4cad2

48548562 has 8 divisors (see below), whose sum is σ = 97097136. Its totient is φ = 16182852.

The previous prime is 48548537. The next prime is 48548567. The reversal of 48548562 is 26584584.

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

It is a sphenic number, since it is the product of 3 distinct primes.

48548562 is an admirable number.

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

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

Almost surely, 248548562 is an apocalyptic number.

48548562 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.

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

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

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

The sum of its prime factors is 8091432.

The product of its digits is 307200, while the sum is 42.

The square root of 48548562 is about 6967.6798146872. The cubic root of 48548562 is about 364.8033268347.

The spelling of 48548562 in words is "forty-eight million, five hundred forty-eight thousand, five hundred sixty-two".

Divisors: 1 2 3 6 8091427 16182854 24274281 48548562