Search a number
-
+
1050005536817 is a prime number
BaseRepresentation
bin11110100011110010011…
…01010000000000110001
310201101020200122220012012
433101321031100000301
5114200402404134232
62122211010412305
7135601054542056
oct17217115200061
93641220586165
101050005536817
1137533982a926
1214b5b8891095
1378027226793
1438b6b7b902d
151c4a68519b2
hexf479350031

1050005536817 has 2 divisors, whose sum is σ = 1050005536818. Its totient is φ = 1050005536816.

The previous prime is 1050005536787. The next prime is 1050005536829. The reversal of 1050005536817 is 7186355000501.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 956403805681 + 93601731136 = 977959^2 + 305944^2 .

It is a cyclic number.

It is not a de Polignac number, because 1050005536817 - 212 = 1050005532721 is a prime.

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

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

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

Almost surely, 21050005536817 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 126000, while the sum is 41.

The spelling of 1050005536817 in words is "one trillion, fifty billion, five million, five hundred thirty-six thousand, eight hundred seventeen".