Search a number
-
+
1056500374141 is a prime number
BaseRepresentation
bin11110101111111000101…
…01000101101001111101
310202000000022211211001201
433113330111011221331
5114302203043433031
62125203301335501
7136221031002622
oct17277425055175
93660008754051
101056500374141
11378071a11283
1215090ba07591
137882098a7a4
14391c61d8349
151c736b32d61
hexf5fc545a7d

1056500374141 has 2 divisors, whose sum is σ = 1056500374142. Its totient is φ = 1056500374140.

The previous prime is 1056500374109. The next prime is 1056500374151. The reversal of 1056500374141 is 1414730056501.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 790239214116 + 266261160025 = 888954^2 + 516005^2 .

It is a cyclic number.

It is not a de Polignac number, because 1056500374141 - 25 = 1056500374109 is a prime.

It is a super-2 number, since 2×10565003741412 (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 1056500374141.

It is a congruent number.

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

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

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

Almost surely, 21056500374141 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 1056500374141 in words is "one trillion, fifty-six billion, five hundred million, three hundred seventy-four thousand, one hundred forty-one".