Search a number
-
+
550005001061 is a prime number
BaseRepresentation
bin10000000000011101101…
…10100100101101100101
31221120122210102222000212
420000032312210231211
533002402240013221
61100400243545205
754510431241425
oct10001666445545
91846583388025
10550005001061
111a228a53695a
128a71768b205
133cb32c4bbb9
141c898496485
15e490b64b5b
hex800eda4b65

550005001061 has 2 divisors, whose sum is σ = 550005001062. Its totient is φ = 550005001060.

The previous prime is 550005000983. The next prime is 550005001093. The reversal of 550005001061 is 160100500055.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 345050508100 + 204954492961 = 587410^2 + 452719^2 .

It is a cyclic number.

It is not a de Polignac number, because 550005001061 - 214 = 550004984677 is a prime.

It is a super-2 number, since 2×5500050010612 (a number of 24 digits) contains 22 as substring.

It is a congruent number.

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

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

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

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

Almost surely, 2550005001061 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 750, while the sum is 23.

The spelling of 550005001061 in words is "five hundred fifty billion, five million, one thousand, sixty-one".