Search a number
-
+
1141045111981 is a prime number
BaseRepresentation
bin10000100110101011100…
…101101010110010101101
311001002020101200111100101
4100212223211222302231
5122143330022040411
62232104444431101
7145303106265025
oct20465345526255
94032211614311
101141045111981
113aaa07245145
12165185848491
13837a5531298
143d3267a6a85
151ea340ca8c1
hex109ab96acad

1141045111981 has 2 divisors, whose sum is σ = 1141045111982. Its totient is φ = 1141045111980.

The previous prime is 1141045111957. The next prime is 1141045112003. The reversal of 1141045111981 is 1891115401411.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1141040558025 + 4553956 = 1068195^2 + 2134^2 .

It is a cyclic number.

It is not a de Polignac number, because 1141045111981 - 211 = 1141045109933 is a prime.

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

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

It is a congruent number.

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

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

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

Almost surely, 21141045111981 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 5760, while the sum is 37.

The spelling of 1141045111981 in words is "one trillion, one hundred forty-one billion, forty-five million, one hundred eleven thousand, nine hundred eighty-one".