Search a number
-
+
1103957269213 is a prime number
BaseRepresentation
bin10000000100001000111…
…110110001101011011101
310220112111200100212120011
4100010020332301223131
5121041401030103323
62203052335323221
7142521042650401
oct20041076615335
93815450325504
101103957269213
11396205109a17
12159b55080511
13801448b81a6
143b608c97101
151dab30d520d
hex10108fb1add

1103957269213 has 2 divisors, whose sum is σ = 1103957269214. Its totient is φ = 1103957269212.

The previous prime is 1103957269201. The next prime is 1103957269277. The reversal of 1103957269213 is 3129627593011.

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 910310626404 + 193646642809 = 954102^2 + 440053^2 .

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

It is a cyclic number.

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

It is a congruent number.

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

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

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

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

Almost surely, 21103957269213 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 612360, while the sum is 49.

The spelling of 1103957269213 in words is "one trillion, one hundred three billion, nine hundred fifty-seven million, two hundred sixty-nine thousand, two hundred thirteen".