Search a number
-
+
48511457 is a prime number
BaseRepresentation
bin1011100100001…
…1100111100001
310101021122012122
42321003213201
544404331312
64451434025
71126224551
oct271034741
9111248178
1048511457
1125424415
12142b5915
13a086a07
14662b161
1543d3b72
hex2e439e1

48511457 has 2 divisors, whose sum is σ = 48511458. Its totient is φ = 48511456.

The previous prime is 48511453. The next prime is 48511459. The reversal of 48511457 is 75411584.

48511457 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., 48497296 + 14161 = 6964^2 + 119^2 .

It is a cyclic number.

It is not a de Polignac number, because 48511457 - 22 = 48511453 is a prime.

It is a super-2 number, since 2×485114572 = 4706722920525698, which contains 22 as substring.

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

It is a Chen prime.

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

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

Almost surely, 248511457 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 22400, while the sum is 35.

The square root of 48511457 is about 6965.0166546822. The cubic root of 48511457 is about 364.7103650879.

The spelling of 48511457 in words is "forty-eight million, five hundred eleven thousand, four hundred fifty-seven".