Search a number
-
+
1055556517 is a prime number
BaseRepresentation
bin111110111010101…
…000001110100101
32201120012211022211
4332322220032211
54130210302032
6252424123421
735105040151
oct7672501645
92646184284
101055556517
114a191a264
12255606571
1313a8bc772
14a0290061
1562a07747
hex3eea83a5

1055556517 has 2 divisors, whose sum is σ = 1055556518. Its totient is φ = 1055556516.

The previous prime is 1055556499. The next prime is 1055556539. The reversal of 1055556517 is 7156555501.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 1054041156 + 1515361 = 32466^2 + 1231^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-1055556517 is a prime.

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

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

It is a congruent number.

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

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

Almost surely, 21055556517 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 131250, while the sum is 40.

The square root of 1055556517 is about 32489.3292790110. The cubic root of 1055556517 is about 1018.1860998503.

The spelling of 1055556517 in words is "one billion, fifty-five million, five hundred fifty-six thousand, five hundred seventeen".