Search a number
-
+
48520097 = 4110111717
BaseRepresentation
bin1011100100010…
…1101110100001
310101022002001122
42321011232201
544410120342
64451542025
71126262003
oct271055641
9111262048
1048520097
112542a95a
12142ba915
13a08a922
146630373
1543d64d2
hex2e45ba1

48520097 has 8 divisors (see below), whose sum is σ = 50199912. Its totient is φ = 46864000.

The previous prime is 48520063. The next prime is 48520123. The reversal of 48520097 is 79002584.

It is a happy number.

48520097 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 4 ways, for example, as 92416 + 48427681 = 304^2 + 6959^2 .

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

It is not a de Polignac number, because 48520097 - 26 = 48520033 is a prime.

It is a Duffinian number.

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

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

Almost surely, 248520097 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 11859.

The product of its (nonzero) digits is 20160, while the sum is 35.

The square root of 48520097 is about 6965.6368696624. The cubic root of 48520097 is about 364.7320157157.

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

Divisors: 1 41 101 4141 11717 480397 1183417 48520097