Search a number
-
+
1103303013023 is a prime number
BaseRepresentation
bin10000000011100001111…
…110111111001010011111
310220110211002021012210102
4100003201332333022133
5121034031032404043
62202503404331315
7142465606606061
oct20034176771237
93813732235712
101103303013023
113959a9873622
121599b1b43b3b
138006c1a3b53
143b586029731
151da7594b6b8
hex100e1fbf29f

1103303013023 has 2 divisors, whose sum is σ = 1103303013024. Its totient is φ = 1103303013022.

The previous prime is 1103303012897. The next prime is 1103303013049. The reversal of 1103303013023 is 3203103033011.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 1103303013023 - 28 = 1103303012767 is a prime.

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

It is a congruent number.

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

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

Almost surely, 21103303013023 is an apocalyptic number.

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

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

1103303013023 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 20.

Adding to 1103303013023 its reverse (3203103033011), we get a palindrome (4306406046034).

The spelling of 1103303013023 in words is "one trillion, one hundred three billion, three hundred three million, thirteen thousand, twenty-three".