Search a number
-
+
1105676871589 is a prime number
BaseRepresentation
bin10000000101101111011…
…110100010011110100101
310220200221112002201120001
4100011233132202132211
5121103411234342324
62203535124341301
7142611463224403
oct20055736423645
93820845081501
101105676871589
11396a07850704
1215a354b44831
1380359c38ba4
143b72d402473
151db6405be44
hex1016f7a27a5

1105676871589 has 2 divisors, whose sum is σ = 1105676871590. Its totient is φ = 1105676871588.

The previous prime is 1105676871547. The next prime is 1105676871619. The reversal of 1105676871589 is 9851786765011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 803473798689 + 302203072900 = 896367^2 + 549730^2 .

It is a cyclic number.

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

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

It is a congruent number.

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

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

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

Almost surely, 21105676871589 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 25401600, while the sum is 64.

The spelling of 1105676871589 in words is "one trillion, one hundred five billion, six hundred seventy-six million, eight hundred seventy-one thousand, five hundred eighty-nine".