Search a number
-
+
1065161455201 is a prime number
BaseRepresentation
bin11111000000000001001…
…00011111011001100001
310202211100221012022200201
433200000210133121201
5114422422313031301
62133154534345201
7136645456661044
oct17400044373141
93684327168621
101065161455201
11380806966708
121525284bb201
13795a116451c
14397a85c8c5b
151ca921b4201
hexf80091f661

1065161455201 has 2 divisors, whose sum is σ = 1065161455202. Its totient is φ = 1065161455200.

The previous prime is 1065161455181. The next prime is 1065161455223. The reversal of 1065161455201 is 1025541615601.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 974713900176 + 90447555025 = 987276^2 + 300745^2 .

It is a cyclic number.

It is not a de Polignac number, because 1065161455201 - 27 = 1065161455073 is a prime.

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

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

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

Almost surely, 21065161455201 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 36000, while the sum is 37.

The spelling of 1065161455201 in words is "one trillion, sixty-five billion, one hundred sixty-one million, four hundred fifty-five thousand, two hundred one".