Search a number
-
+
1100909123 is a prime number
BaseRepresentation
bin100000110011110…
…1000101001000011
32211201112222101222
41001213220221003
54223313042443
6301124145255
736165400406
oct10147505103
92751488358
101100909123
11515486356
1226883822b
1314710b722
14a62d7d3d
15669b5468
hex419e8a43

1100909123 has 2 divisors, whose sum is σ = 1100909124. Its totient is φ = 1100909122.

The previous prime is 1100909111. The next prime is 1100909129. The reversal of 1100909123 is 3219090011.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 1100909123 - 28 = 1100908867 is a prime.

It is a Sophie Germain prime.

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

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

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

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

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

Almost surely, 21100909123 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 486, while the sum is 26.

The square root of 1100909123 is about 33179.9506178053. The cubic root of 1100909123 is about 1032.5644218725.

Adding to 1100909123 its reverse (3219090011), we get a palindrome (4319999134).

The spelling of 1100909123 in words is "one billion, one hundred million, nine hundred nine thousand, one hundred twenty-three".