Search a number
-
+
1101056557 is a prime number
BaseRepresentation
bin100000110100000…
…1100101000101101
32211201211110122111
41001220030220231
54223332302212
6301131244021
736166553266
oct10150145055
92751743574
101101056557
115155770a7
122688a9611
13147160873
14a633596d
15669e3ea7
hex41a0ca2d

1101056557 has 2 divisors, whose sum is σ = 1101056558. Its totient is φ = 1101056556.

The previous prime is 1101056531. The next prime is 1101056563. The reversal of 1101056557 is 7556501011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 891559881 + 209496676 = 29859^2 + 14474^2 .

It is a cyclic number.

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

It is a congruent number.

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

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

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

Almost surely, 21101056557 is an apocalyptic number.

It is an amenable number.

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

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

1101056557 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 5250, while the sum is 31.

The square root of 1101056557 is about 33182.1722766910. The cubic root of 1101056557 is about 1032.6105135691.

Adding to 1101056557 its reverse (7556501011), we get a palindrome (8657557568).

The spelling of 1101056557 in words is "one billion, one hundred one million, fifty-six thousand, five hundred fifty-seven".