Search a number
-
+
1103273051 is a prime number
BaseRepresentation
bin100000111000010…
…1001110001011011
32211220000002002212
41001300221301123
54224414214201
6301250545335
736224444336
oct10160516133
92756002085
101103273051
11516850411
1226959824b
131477586ba
14a675161d
1566cd0abb
hex41c29c5b

1103273051 has 2 divisors, whose sum is σ = 1103273052. Its totient is φ = 1103273050.

The previous prime is 1103273029. The next prime is 1103273063. The reversal of 1103273051 is 1503723011.

It is a strong prime.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-1103273051 is a prime.

It is a super-2 number, since 2×11032730512 = 2434422850125697202, which contains 22 as substring.

It is a Sophie Germain prime.

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

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

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

Almost surely, 21103273051 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 630, while the sum is 23.

The square root of 1103273051 is about 33215.5543533448. The cubic root of 1103273051 is about 1033.3029517834.

Adding to 1103273051 its reverse (1503723011), we get a palindrome (2606996062).

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