Search a number
-
+
1050575327363 is a prime number
BaseRepresentation
bin11110100100110110010…
…10110101000010000011
310201102201101211020212202
433102123022311002003
5114203034240433423
62122343323143415
7135621143641022
oct17223312650203
93642641736782
101050575327363
11375601424a01
1214b737674b6b
13780b82a5c53
1438bc333a8b9
151c4db8a3728
hexf49b2b5083

1050575327363 has 2 divisors, whose sum is σ = 1050575327364. Its totient is φ = 1050575327362.

The previous prime is 1050575327287. The next prime is 1050575327419. The reversal of 1050575327363 is 3637235750501.

It is a strong prime.

It is an emirp because it is prime and its reverse (3637235750501) is a distict prime.

It is a cyclic number.

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

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

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

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

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

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

Almost surely, 21050575327363 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 1984500, while the sum is 47.

The spelling of 1050575327363 in words is "one trillion, fifty billion, five hundred seventy-five million, three hundred twenty-seven thousand, three hundred sixty-three".