Search a number
-
+
2548961 is a prime number
BaseRepresentation
bin1001101110010011100001
311210111111222
421232103201
51123031321
6130344425
730444242
oct11562341
94714458
102548961
111491088
12a2b115
136b327c
144a4cc9
153553ab
hex26e4e1

2548961 has 2 divisors, whose sum is σ = 2548962. Its totient is φ = 2548960.

The previous prime is 2548957. The next prime is 2548969. The reversal of 2548961 is 1698452.

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

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 2119936 + 429025 = 1456^2 + 655^2 .

It is a cyclic number.

It is not a de Polignac number, because 2548961 - 22 = 2548957 is a prime.

It is a Sophie Germain prime.

It is a Chen prime.

It is a Curzon number.

It is equal to p186389 and since 2548961 and 186389 have the same sum of digits, it is a Honaker prime.

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

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

22548961 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The square root of 2548961 is about 1596.5465856028. The cubic root of 2548961 is about 136.6011630043.

The spelling of 2548961 in words is "two million, five hundred forty-eight thousand, nine hundred sixty-one".