Search a number
-
+
48905535 = 3572331999
BaseRepresentation
bin1011101010001…
…1110100111111
310102000122210010
42322203310333
5100004434120
64504114303
71132455510
oct272436477
9112018703
1048905535
11256734a8
1214465993
13a1941b3
1466d0a07
1544607e0
hex2ea3d3f

48905535 has 32 divisors (see below), whose sum is σ = 89856000. Its totient is φ = 22249728.

The previous prime is 48905531. The next prime is 48905539. The reversal of 48905535 is 53550984.

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

It is not a de Polignac number, because 48905535 - 22 = 48905531 is a prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 248905535 is an apocalyptic number.

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

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

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

The sum of its prime factors is 2247.

The product of its (nonzero) digits is 108000, while the sum is 39.

The square root of 48905535 is about 6993.2492448075. The cubic root of 48905535 is about 365.6952657708.

The spelling of 48905535 in words is "forty-eight million, nine hundred five thousand, five hundred thirty-five".

Divisors: 1 3 5 7 15 21 35 105 233 699 1165 1631 1999 3495 4893 5997 8155 9995 13993 24465 29985 41979 69965 209895 465767 1397301 2328835 3260369 6986505 9781107 16301845 48905535