Search a number
-
+
1063928902061 is a prime number
BaseRepresentation
bin11110111101101110001…
…10101011000110101101
310202201012000221010122102
433132313012223012231
5114412411244331221
62132432344424445
7136603102311464
oct17366706530655
93681160833572
101063928902061
11380234146253
12152243778125
13794359b2c3c
14396cca239db
151ca1dd9830b
hexf7b71ab1ad

1063928902061 has 2 divisors, whose sum is σ = 1063928902062. Its totient is φ = 1063928902060.

The previous prime is 1063928902007. The next prime is 1063928902063. The reversal of 1063928902061 is 1602098293601.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 583686832036 + 480242070025 = 763994^2 + 692995^2 .

It is a cyclic number.

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

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

Together with 1063928902063, it forms a pair of twin primes.

It is a Chen prime.

It is a junction number, because it is equal to n+sod(n) for n = 1063928901997 and 1063928902015.

It is a congruent number.

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

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

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

Almost surely, 21063928902061 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 1063928902061 in words is "one trillion, sixty-three billion, nine hundred twenty-eight million, nine hundred two thousand, sixty-one".