Search a number
-
+
1114621076741 is a prime number
BaseRepresentation
bin10000001110000100100…
…101111110010100000101
310221120000212012102102112
4100032010211332110011
5121230220443423431
62212014433550405
7143346230554304
oct20160445762405
93846025172375
101114621076741
1139a7875a3397
12160030415405
1381153c82283
143bd3b25243b
151ded93b6c2b
hex1038497e505

1114621076741 has 2 divisors, whose sum is σ = 1114621076742. Its totient is φ = 1114621076740.

The previous prime is 1114621076731. The next prime is 1114621076801. The reversal of 1114621076741 is 1476701264111.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 741916931716 + 372704145025 = 861346^2 + 610495^2 .

It is a cyclic number.

It is not a de Polignac number, because 1114621076741 - 234 = 1097441207557 is a prime.

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

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

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

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

Almost surely, 21114621076741 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 56448, while the sum is 41.

The spelling of 1114621076741 in words is "one trillion, one hundred fourteen billion, six hundred twenty-one million, seventy-six thousand, seven hundred forty-one".