Search a number
-
+
1193262295681 is a prime number
BaseRepresentation
bin10001010111010011111…
…110011010101010000001
311020002000111112021020001
4101113103332122222001
5124022300121430211
62312102132120001
7152132103106141
oct21272376325201
94202014467201
101193262295681
11420072504115
12173319166001
13886a773ac11
1441a7b768921
152108d433ac1
hex115d3f9aa81

1193262295681 has 2 divisors, whose sum is σ = 1193262295682. Its totient is φ = 1193262295680.

The previous prime is 1193262295651. The next prime is 1193262295723. The reversal of 1193262295681 is 1865922623911.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 927145597456 + 266116698225 = 962884^2 + 515865^2 .

It is a cyclic number.

It is not a de Polignac number, because 1193262295681 - 27 = 1193262295553 is a prime.

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

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

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

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

Almost surely, 21193262295681 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 2799360, while the sum is 55.

The spelling of 1193262295681 in words is "one trillion, one hundred ninety-three billion, two hundred sixty-two million, two hundred ninety-five thousand, six hundred eighty-one".