Search a number
-
+
1065692764153 is a prime number
BaseRepresentation
bin11111000001000000011…
…11010001011111111001
310202212201221221121120001
433200200033101133321
5114430014321423103
62133323354233001
7136664601014533
oct17404017213771
93685657847501
101065692764153
11380a59867a16
12152656425761
137965725c314
1439818db0853
151cac3b6401d
hexf8203d17f9

1065692764153 has 2 divisors, whose sum is σ = 1065692764154. Its totient is φ = 1065692764152.

The previous prime is 1065692764091. The next prime is 1065692764181. The reversal of 1065692764153 is 3514672965601.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 949011085584 + 116681678569 = 974172^2 + 341587^2 .

It is a cyclic number.

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

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

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

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

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

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

Almost surely, 21065692764153 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 8164800, while the sum is 55.

The spelling of 1065692764153 in words is "one trillion, sixty-five billion, six hundred ninety-two million, seven hundred sixty-four thousand, one hundred fifty-three".