Search a number
-
+
549549941 is a prime number
BaseRepresentation
bin100000110000010…
…111011101110101
31102022002000210112
4200300113131311
52111141044231
6130310432405
716422045263
oct4060273565
91368060715
10549549941
11262230006
12134062705
1389b136a5
1452db3433
15333a492b
hex20c17775

549549941 has 2 divisors, whose sum is σ = 549549942. Its totient is φ = 549549940.

The previous prime is 549549919. The next prime is 549549947. The reversal of 549549941 is 149945945.

549549941 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., 495952900 + 53597041 = 22270^2 + 7321^2 .

It is a cyclic number.

It is not a de Polignac number, because 549549941 - 210 = 549548917 is a prime.

It is a super-3 number, since 3×5495499413 (a number of 27 digits) contains 333 as substring.

It is a Chen prime.

It is a self number, because there is not a number n which added to its sum of digits gives 549549941.

It is a congruent number.

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

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

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

Almost surely, 2549549941 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 1166400, while the sum is 50.

The square root of 549549941 is about 23442.4815452631. The cubic root of 549549941 is about 819.0977290631.

The spelling of 549549941 in words is "five hundred forty-nine million, five hundred forty-nine thousand, nine hundred forty-one".