Search a number
-
+
48502477 is a prime number
BaseRepresentation
bin1011100100000…
…1011011001101
310101021011220001
42321001123031
544404034402
64451324301
71126156432
oct271013315
9111234801
1048502477
11254186a1
12142b0691
13a0828ba
146627b89
1543d1187
hex2e416cd

48502477 has 2 divisors, whose sum is σ = 48502478. Its totient is φ = 48502476.

The previous prime is 48502463. The next prime is 48502483. The reversal of 48502477 is 77420584.

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

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 26842761 + 21659716 = 5181^2 + 4654^2 .

It is a cyclic number.

It is not a de Polignac number, because 48502477 - 223 = 40113869 is a prime.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (48502457) 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 as a sum of consecutive naturals, namely, 24251238 + 24251239.

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

Almost surely, 248502477 is an apocalyptic number.

It is an amenable number.

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

48502477 is an equidigital number, since it uses as much as digits as its factorization.

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

The product of its (nonzero) digits is 62720, while the sum is 37.

The square root of 48502477 is about 6964.3719745574. The cubic root of 48502477 is about 364.6878597432.

The spelling of 48502477 in words is "forty-eight million, five hundred two thousand, four hundred seventy-seven".