Search a number
-
+
1155571555951 is a prime number
BaseRepresentation
bin10000110100001101011…
…011101001111001101111
311002110201202202022021201
4100310031123221321233
5122413102304242301
62242510124510331
7146326066105441
oct20641533517157
94073652668251
101155571555951
1140609102153a
12167b5a6ab3a7
1384c7bc23767
143dd03b5a491
15200d454c201
hex10d0d6e9e6f

1155571555951 has 2 divisors, whose sum is σ = 1155571555952. Its totient is φ = 1155571555950.

The previous prime is 1155571555933. The next prime is 1155571556057. The reversal of 1155571555951 is 1595551755511.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 1155571555951 - 27 = 1155571555823 is a prime.

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

It is a congruent number.

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

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

Almost surely, 21155571555951 is an apocalyptic number.

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

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

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

The product of its digits is 4921875, while the sum is 55.

The spelling of 1155571555951 in words is "one trillion, one hundred fifty-five billion, five hundred seventy-one million, five hundred fifty-five thousand, nine hundred fifty-one".