Search a number
-
+
1103700641 is a prime number
BaseRepresentation
bin100000111001001…
…0010001010100001
32211220210210122112
41001302102022201
54230021410031
6301304045105
736231205061
oct10162221241
92756723575
101103700641
1151701269a
12269763795
13147878204
14a68233a1
1566d6762b
hex41c922a1

1103700641 has 2 divisors, whose sum is σ = 1103700642. Its totient is φ = 1103700640.

The previous prime is 1103700623. The next prime is 1103700643. The reversal of 1103700641 is 1460073011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 918332416 + 185368225 = 30304^2 + 13615^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 1103700641 - 210 = 1103699617 is a prime.

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

It is a Chen prime.

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

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

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

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

Almost surely, 21103700641 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The square root of 1103700641 is about 33221.9903226763. The cubic root of 1103700641 is about 1033.4364252216.

Adding to 1103700641 its reverse (1460073011), we get a palindrome (2563773652).

The spelling of 1103700641 in words is "one billion, one hundred three million, seven hundred thousand, six hundred forty-one".