Search a number
-
+
11601167863141 is a prime number
BaseRepresentation
bin1010100011010001101101…
…1111010100110101100101
31112002001122100001022212001
42220310123133110311211
53010033142433110031
640401300345125301
72305104516541213
oct250643337246545
945061570038761
1011601167863141
1137730338a935a
121374473789831
13661ca700322c
142c16dc981cb3
15151b8dd15861
hexa8d1b7d4d65

11601167863141 has 2 divisors, whose sum is σ = 11601167863142. Its totient is φ = 11601167863140.

The previous prime is 11601167863091. The next prime is 11601167863231. The reversal of 11601167863141 is 14136876110611.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 11575788187041 + 25379676100 = 3402321^2 + 159310^2 .

It is a cyclic number.

It is not a de Polignac number, because 11601167863141 - 27 = 11601167863013 is a prime.

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

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

It is a congruent number.

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

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

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

Almost surely, 211601167863141 is an apocalyptic number.

It is an amenable number.

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

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

11601167863141 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 145152, while the sum is 46.

The spelling of 11601167863141 in words is "eleven trillion, six hundred one billion, one hundred sixty-seven million, eight hundred sixty-three thousand, one hundred forty-one".