Search a number
-
+
1111997925881 is a prime number
BaseRepresentation
bin10000001011101000001…
…111011100100111111001
310221022021001021112220222
4100023220033130213321
5121204332432112011
62210502250425425
7143224226262203
oct20135017344771
93838231245828
101111997925881
11399660926317
1215b619a32275
1380b266949bb
143bb6cb05773
151ddd3e61ddb
hex102e83dc9f9

1111997925881 has 2 divisors, whose sum is σ = 1111997925882. Its totient is φ = 1111997925880.

The previous prime is 1111997925869. The next prime is 1111997925887. The reversal of 1111997925881 is 1885297991111.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1109038565881 + 2959360000 = 1053109^2 + 54400^2 .

It is an emirp because it is prime and its reverse (1885297991111) is a distict prime.

It is a cyclic number.

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

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

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

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

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

Almost surely, 21111997925881 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 3265920, while the sum is 62.

The spelling of 1111997925881 in words is "one trillion, one hundred eleven billion, nine hundred ninety-seven million, nine hundred twenty-five thousand, eight hundred eighty-one".