Search a number
-
+
1139741904853 is a prime number
BaseRepresentation
bin10000100101011101111…
…010010100111111010101
311000221212120110201020201
4100211131322110333111
5122133142411423403
62231331252300501
7145225603226236
oct20453572247725
94027776421221
101139741904853
113aa3a8657362
12164a81311731
13836285425c6
143d24168d08d
151e9a99a521d
hex1095de94fd5

1139741904853 has 2 divisors, whose sum is σ = 1139741904854. Its totient is φ = 1139741904852.

The previous prime is 1139741904823. The next prime is 1139741904877. The reversal of 1139741904853 is 3584091479311.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 583049834929 + 556692069924 = 763577^2 + 746118^2 .

It is a cyclic number.

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

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

It is a congruent number.

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

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

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

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

Almost surely, 21139741904853 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 3265920, while the sum is 55.

The spelling of 1139741904853 in words is "one trillion, one hundred thirty-nine billion, seven hundred forty-one million, nine hundred four thousand, eight hundred fifty-three".