Search a number
-
+
48527061 = 3111786501
BaseRepresentation
bin1011100100011…
…1011011010101
310101022102121120
42321013123111
544410331221
64452034153
71126321212
oct271073325
9111272546
1048527061
1125435110
1214302959
13a090b4b
146632b09
1543d85c6
hex2e476d5

48527061 has 16 divisors (see below), whose sum is σ = 74737728. Its totient is φ = 27680000.

The previous prime is 48527057. The next prime is 48527069. The reversal of 48527061 is 16072584.

It is a cyclic number.

It is not a de Polignac number, because 48527061 - 22 = 48527057 is a prime.

It is a Smith number, since the sum of its digits (33) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.

It is a Harshad number since it is a multiple of its sum of digits (33).

It is a congruent number.

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 42690 + ... + 43811.

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

Almost surely, 248527061 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 86532.

The product of its (nonzero) digits is 13440, while the sum is 33.

The square root of 48527061 is about 6966.1367342308. The cubic root of 48527061 is about 364.7494646521.

The spelling of 48527061 in words is "forty-eight million, five hundred twenty-seven thousand, sixty-one".

Divisors: 1 3 11 17 33 51 187 561 86501 259503 951511 1470517 2854533 4411551 16175687 48527061