Search a number
-
+
48566048 = 251517689
BaseRepresentation
bin1011100101000…
…0111100100000
310101101102002112
42321100330200
544413103143
64452534452
71126542656
oct271207440
9111342075
1048566048
1125461433
1214321428
13a0a580b
146642dd6
1543e4e18
hex2e50f20

48566048 has 12 divisors (see below), whose sum is σ = 95614470. Its totient is φ = 24283008.

The previous prime is 48566047. The next prime is 48566083. The reversal of 48566048 is 84066584.

It can be written as a sum of positive squares in only one way, i.e., 41319184 + 7246864 = 6428^2 + 2692^2 .

It is a super-2 number, since 2×485660482 = 4717322036676608, which contains 22 as substring.

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

It is not an unprimeable number, because it can be changed into a prime (48566047) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (11) of ones.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 758813 + ... + 758876.

Almost surely, 248566048 is an apocalyptic number.

It is an amenable number.

48566048 is a deficient number, since it is larger than the sum of its proper divisors (47048422).

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

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

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

The product of its (nonzero) digits is 184320, while the sum is 41.

The square root of 48566048 is about 6968.9344953156. The cubic root of 48566048 is about 364.8471193111.

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

Divisors: 1 2 4 8 16 32 1517689 3035378 6070756 12141512 24283024 48566048