Search a number
-
+
1103152007 is a prime number
BaseRepresentation
bin100000111000000…
…1100001110000111
32211212202221001202
41001300030032013
54224401331012
6301244213115
736223431416
oct10160141607
92755687052
101103152007
11516778481
1226953a19b
13147715589
14a671d47d
1566ca9cc2
hex41c0c387

1103152007 has 2 divisors, whose sum is σ = 1103152008. Its totient is φ = 1103152006.

The previous prime is 1103151961. The next prime is 1103152009. The reversal of 1103152007 is 7002513011.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 1103152007 - 216 = 1103086471 is a prime.

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

It is a Chen prime.

It is a self number, because there is not a number n which added to its sum of digits gives 1103152007.

It is a congruent number.

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

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

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

Almost surely, 21103152007 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 210, while the sum is 20.

The square root of 1103152007 is about 33213.7322052190. The cubic root of 1103152007 is about 1033.2651612905.

Adding to 1103152007 its reverse (7002513011), we get a palindrome (8105665018).

The spelling of 1103152007 in words is "one billion, one hundred three million, one hundred fifty-two thousand, seven".