Search a number
-
+
48506429 is a prime number
BaseRepresentation
bin1011100100001…
…0011000111101
310101021101022102
42321002120331
544404201204
64451354445
71126204106
oct271023075
9111241272
1048506429
1125420664
12142b2a25
13a08463a
1466293ad
1543d241e
hex2e4263d

48506429 has 2 divisors, whose sum is σ = 48506430. Its totient is φ = 48506428.

The previous prime is 48506401. The next prime is 48506431. The reversal of 48506429 is 92460584.

48506429 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., 39715204 + 8791225 = 6302^2 + 2965^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-48506429 is a prime.

Together with 48506431, it forms a pair of twin primes.

It is a Chen prime.

It is a junction number, because it is equal to n+sod(n) for n = 48506392 and 48506401.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (48506489) 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, 24253214 + 24253215.

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

Almost surely, 248506429 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 69120, while the sum is 38.

The square root of 48506429 is about 6964.6556985970. The cubic root of 48506429 is about 364.6977644420.

The spelling of 48506429 in words is "forty-eight million, five hundred six thousand, four hundred twenty-nine".