Search a number
-
+
48546401 is a prime number
BaseRepresentation
bin1011100100110…
…0001001100001
310101100102010212
42321030021201
544411441101
64452303505
71126431461
oct271141141
9111312125
1048546401
11254486a2
1214311b95
13a0998a7
146639ba1
1543de1bb
hex2e4c261

48546401 has 2 divisors, whose sum is σ = 48546402. Its totient is φ = 48546400.

The previous prime is 48546389. The next prime is 48546409. The reversal of 48546401 is 10464584.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 37149025 + 11397376 = 6095^2 + 3376^2 .

It is a cyclic number.

It is not a de Polignac number, because 48546401 - 222 = 44352097 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

It is not a weakly prime, because it can be changed into another prime (48546409) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (11) of ones.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 24273200 + 24273201.

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

Almost surely, 248546401 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 15360, while the sum is 32.

The square root of 48546401 is about 6967.5247398197. The cubic root of 48546401 is about 364.7979140297.

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