Search a number
-
+
1101210200212 = 22275302550053
BaseRepresentation
bin10000000001100101001…
…111100010100010010100
310220021102020021022022211
4100001211033202202110
5121020234302401322
62201520004203204
7142363005155023
oct20014517424224
93807366238284
101101210200212
113950254a4361
12159509099504
137cac7731485
143b4280d08ba
151d9a1d53b77
hex100653e2894

1101210200212 has 6 divisors (see below), whose sum is σ = 1927117850378. Its totient is φ = 550605100104.

The previous prime is 1101210200137. The next prime is 1101210200249. The reversal of 1101210200212 is 2120020121011.

It can be written as a sum of positive squares in only one way, i.e., 757481271556 + 343728928656 = 870334^2 + 586284^2 .

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

It is a congruent number.

It is an unprimeable number.

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

Almost surely, 21101210200212 is an apocalyptic number.

It is an amenable number.

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

1101210200212 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 275302550057 (or 275302550055 counting only the distinct ones).

The product of its (nonzero) digits is 16, while the sum is 13.

Adding to 1101210200212 its reverse (2120020121011), we get a palindrome (3221230321223).

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

Divisors: 1 2 4 275302550053 550605100106 1101210200212