Search a number
-
+
48525770 = 254852577
BaseRepresentation
bin1011100100011…
…1000111001010
310101022100211202
42321013013022
544410311040
64452024202
71126314356
oct271070712
9111270752
1048525770
1125434147
1214302062
13a090397
146632466
1543d8015
hex2e471ca

48525770 has 8 divisors (see below), whose sum is σ = 87346404. Its totient is φ = 19410304.

The previous prime is 48525767. The next prime is 48525779. The reversal of 48525770 is 7752584.

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

It can be written as a sum of positive squares in 2 ways, for example, as 48288601 + 237169 = 6949^2 + 487^2 .

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

It is not an unprimeable number, because it can be changed into a prime (48525779) 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, 2426279 + ... + 2426298.

Almost surely, 248525770 is an apocalyptic number.

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

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

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

The sum of its prime factors is 4852584.

The product of its (nonzero) digits is 78400, while the sum is 38.

The square root of 48525770 is about 6966.0440710636. The cubic root of 48525770 is about 364.7462300600.

It can be divided in two parts, 48 and 525770, that multiplied together give a triangular number (25236960 = T7104).

The spelling of 48525770 in words is "forty-eight million, five hundred twenty-five thousand, seven hundred seventy".

Divisors: 1 2 5 10 4852577 9705154 24262885 48525770