Search a number
-
+
1100110100213 is a prime number
BaseRepresentation
bin10000000000100011101…
…010111111011011110101
310220011120120020102211102
4100000203222333123311
5121011011141201323
62201214505215445
7142323516364265
oct20004352773365
93804516212742
101100110100213
11394610520a03
12159260791585
137c980847127
143b361d677a5
151d93a49d328
hex10023abf6f5

1100110100213 has 2 divisors, whose sum is σ = 1100110100214. Its totient is φ = 1100110100212.

The previous prime is 1100110100209. The next prime is 1100110100251. The reversal of 1100110100213 is 3120010110011.

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., 702148471249 + 397961628964 = 837943^2 + 630842^2 .

It is a cyclic number.

It is not a de Polignac number, because 1100110100213 - 22 = 1100110100209 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 21100110100213 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 6, while the sum is 11.

Adding to 1100110100213 its reverse (3120010110011), we get a palindrome (4220120210224).

The spelling of 1100110100213 in words is "one trillion, one hundred billion, one hundred ten million, one hundred thousand, two hundred thirteen".