Search a number
-
+
1112595940847 is a prime number
BaseRepresentation
bin10000001100001011111…
…000101100010111101111
310221100210201112212020102
4100030023320230113233
5121212044030101342
62211041452141315
7143245110313106
oct20141370542757
93840721485212
101112595940847
11399938448866
1215b76616783b
1380bc0546c01
143bbc82d303d
151de1b6db832
hex1030be2c5ef

1112595940847 has 2 divisors, whose sum is σ = 1112595940848. Its totient is φ = 1112595940846.

The previous prime is 1112595940837. The next prime is 1112595940849. The reversal of 1112595940847 is 7480495952111.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 1112595940847 - 28 = 1112595940591 is a prime.

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

Together with 1112595940849, it forms a pair of twin primes.

It is a Chen prime.

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

It is a congruent number.

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

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

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

Almost surely, 21112595940847 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 3628800, while the sum is 56.

The spelling of 1112595940847 in words is "one trillion, one hundred twelve billion, five hundred ninety-five million, nine hundred forty thousand, eight hundred forty-seven".