Search a number
-
+
1192689313 is a prime number
BaseRepresentation
bin100011100010110…
…1111111010100001
310002010020220011021
41013011233322201
54420312024223
6314203245441
741361456214
oct10705577241
93063226137
101192689313
11562273152
12293519881
13160134a2a
14b458977b
156ea9465d
hex4716fea1

1192689313 has 2 divisors, whose sum is σ = 1192689314. Its totient is φ = 1192689312.

The previous prime is 1192689269. The next prime is 1192689331. The reversal of 1192689313 is 3139862911.

Together with next prime (1192689331) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 976687504 + 216001809 = 31252^2 + 14697^2 .

It is a cyclic number.

It is not a de Polignac number, because 1192689313 - 29 = 1192688801 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 1192689313.

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

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

Almost surely, 21192689313 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 69984, while the sum is 43.

The square root of 1192689313 is about 34535.3342679639. The cubic root of 1192689313 is about 1060.4961819073.

The spelling of 1192689313 in words is "one billion, one hundred ninety-two million, six hundred eighty-nine thousand, three hundred thirteen".