Search a number
-
+
48513601 = 232109287
BaseRepresentation
bin1011100100010…
…0001001000001
310101021202011001
42321010021001
544404413401
64451452001
71126234033
oct271041101
9111252131
1048513601
1125425a94
12142b7001
13a087996
14662bc53
1543d4601
hex2e44241

48513601 has 4 divisors (see below), whose sum is σ = 50622912. Its totient is φ = 46404292.

The previous prime is 48513581. The next prime is 48513617. The reversal of 48513601 is 10631584.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

It is not a de Polignac number, because 48513601 - 27 = 48513473 is a prime.

It is a Duffinian number.

It is a self number, because there is not a number n which added to its sum of digits gives 48513601.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1054621 + ... + 1054666.

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

Almost surely, 248513601 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 2109310.

The product of its (nonzero) digits is 2880, while the sum is 28.

The square root of 48513601 is about 6965.1705650328. The cubic root of 48513601 is about 364.7157378909.

The spelling of 48513601 in words is "forty-eight million, five hundred thirteen thousand, six hundred one".

Divisors: 1 23 2109287 48513601