Search a number
-
+
1101210100101 = 37503525423
BaseRepresentation
bin10000000001100101001…
…111001010000110000101
310220021102020002020000000
4100001211033022012011
5121020234241200401
62201520002111513
7142363004260116
oct20014517120605
93807366066000
101101210100101
11395025436121
1215950904b599
137cac76c7a37
143b4280a620d
151d9a1d34186
hex100653ca185

1101210100101 has 16 divisors (see below), whose sum is σ = 1651563390720. Its totient is φ = 734140065276.

The previous prime is 1101210100057. The next prime is 1101210100103. The reversal of 1101210100101 is 1010010121011.

It is not a de Polignac number, because 1101210100101 - 213 = 1101210091909 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (9).

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (1101210100103) by changing a digit.

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 251760525 + ... + 251764898.

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

Almost surely, 21101210100101 is an apocalyptic number.

It is an amenable number.

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

1101210100101 is an frugal number, since it uses more digits than its factorization.

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

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

The product of its (nonzero) digits is 2, while the sum is 9.

Adding to 1101210100101 its reverse (1010010121011), we get a palindrome (2111220221112).

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

Divisors: 1 3 9 27 81 243 729 2187 503525423 1510576269 4531728807 13595186421 40785559263 122356677789 367070033367 1101210100101