Search a number
-
+
48550073 = 111319107167
BaseRepresentation
bin1011100100110…
…1000010111001
310101100121011212
42321031002321
544412100243
64452332505
71126445255
oct271150271
9111317155
1048550073
1125450430
1214314135
13a09b470
14663b265
1543e0318
hex2e4d0b9

48550073 has 32 divisors (see below), whose sum is σ = 60963840. Its totient is φ = 38007360.

The previous prime is 48550069. The next prime is 48550091. The reversal of 48550073 is 37005584.

It is a happy number.

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

It is a cyclic number.

It is not a de Polignac number, because 48550073 - 22 = 48550069 is a prime.

It is a Duffinian number.

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

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

Almost surely, 248550073 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 317.

The product of its (nonzero) digits is 16800, while the sum is 32.

The square root of 48550073 is about 6967.7882430510. The cubic root of 48550073 is about 364.8071114446.

The spelling of 48550073 in words is "forty-eight million, five hundred fifty thousand, seventy-three".

Divisors: 1 11 13 19 107 143 167 209 247 1177 1391 1837 2033 2171 2717 3173 15301 17869 22363 23881 26429 34903 41249 196559 232297 290719 339511 453739 2555267 3734621 4413643 48550073