Search a number
-
+
1103146523 is a prime number
BaseRepresentation
bin100000111000000…
…1010111000011011
32211212202122112122
41001300022320123
54224401142043
6301244131455
736223406423
oct10160127033
92755678478
101103146523
11516774346
12269536b8b
13147712c2b
14a671b483
1566ca8368
hex41c0ae1b

1103146523 has 2 divisors, whose sum is σ = 1103146524. Its totient is φ = 1103146522.

The previous prime is 1103146519. The next prime is 1103146529. The reversal of 1103146523 is 3256413011.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 1103146523 - 22 = 1103146519 is a prime.

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

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

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

Almost surely, 21103146523 is an apocalyptic number.

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

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

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

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

The square root of 1103146523 is about 33213.6496489019. The cubic root of 1103146523 is about 1033.2634490951.

Adding to 1103146523 its reverse (3256413011), we get a palindrome (4359559534).

The spelling of 1103146523 in words is "one billion, one hundred three million, one hundred forty-six thousand, five hundred twenty-three".