Search a number
-
+
1103303020723 is a prime number
BaseRepresentation
bin10000000011100001111…
…111000001000010110011
310220110211002021121100121
4100003201333001002303
5121034031033130343
62202503404431111
7142465606640401
oct20034177010263
93813732247317
101103303020723
113959a9879392
121599b1b48497
138006c1a74c7
143b58602c471
151da7594daed
hex100e1fc10b3

1103303020723 has 2 divisors, whose sum is σ = 1103303020724. Its totient is φ = 1103303020722.

The previous prime is 1103303020711. The next prime is 1103303020733. The reversal of 1103303020723 is 3270203033011.

It is a strong prime.

It is an emirp because it is prime and its reverse (3270203033011) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 1103303020723 - 25 = 1103303020691 is a prime.

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

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

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

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

Almost surely, 21103303020723 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 2268, while the sum is 25.

Adding to 1103303020723 its reverse (3270203033011), we get a palindrome (4373506053734).

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