Search a number
-
+
1115852643151 is a prime number
BaseRepresentation
bin10000001111001110000…
…000000001101101001111
310221200012200121110221021
4100033032000001231033
5121240231234040101
62212340550415011
7143421603654031
oct20171600015517
93850180543837
101115852643151
113a02597aa474
12160314961467
13812bc1796ac
143c016a3bc51
151e05c58a5a1
hex103ce001b4f

1115852643151 has 2 divisors, whose sum is σ = 1115852643152. Its totient is φ = 1115852643150.

The previous prime is 1115852643149. The next prime is 1115852643163. The reversal of 1115852643151 is 1513462585111.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 1115852643151 - 21 = 1115852643149 is a prime.

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

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

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (1115852640151) 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, 557926321575 + 557926321576.

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

Almost surely, 21115852643151 is an apocalyptic number.

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

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

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

The product of its digits is 144000, while the sum is 43.

The spelling of 1115852643151 in words is "one trillion, one hundred fifteen billion, eight hundred fifty-two million, six hundred forty-three thousand, one hundred fifty-one".