Search a number
-
+
1163694853159 is a prime number
BaseRepresentation
bin10000111011110001100…
…111100100110000100111
311010020200220011120011021
4100323301213210300213
5123031221340300114
62250332151152011
7150034305021616
oct20736147446047
94106626146137
101163694853159
1140957a452a03
12169647075607
1385974b764b7
144047495b87d
152040c7a0024
hex10ef19e4c27

1163694853159 has 2 divisors, whose sum is σ = 1163694853160. Its totient is φ = 1163694853158.

The previous prime is 1163694853151. The next prime is 1163694853231. The reversal of 1163694853159 is 9513584963611.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 1163694853159 - 23 = 1163694853151 is a prime.

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

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

It is a congruent number.

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

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

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

Almost surely, 21163694853159 is an apocalyptic number.

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

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

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

The product of its digits is 20995200, while the sum is 61.

The spelling of 1163694853159 in words is "one trillion, one hundred sixty-three billion, six hundred ninety-four million, eight hundred fifty-three thousand, one hundred fifty-nine".