Search a number
-
+
1102010200101 = 32199615304411
BaseRepresentation
bin10000000010010100111…
…011010011000000100101
310220100110222121111212100
4100002110323103000211
5121023404102400401
62202131223042313
7142421561101146
oct20022473230045
93810428544770
101102010200101
113953a6035098
121596b0ba0399
137cbc43b42a5
143b4a2459acd
151d9ec1cab86
hex10094ed3025

1102010200101 has 12 divisors (see below), whose sum is σ = 1599791471200. Its totient is φ = 730981639080.

The previous prime is 1102010200099. The next prime is 1102010200111. The reversal of 1102010200101 is 1010020102011.

It is a happy number.

It is not a de Polignac number, because 1102010200101 - 21 = 1102010200099 is a prime.

It is a super-2 number, since 2×11020102001012 (a number of 25 digits) contains 22 as substring.

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

It is a Duffinian number.

It is a congruent number.

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 307650415 + ... + 307653996.

Almost surely, 21102010200101 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

Adding to 1102010200101 its reverse (1010020102011), we get a palindrome (2112030302112).

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

Divisors: 1 3 9 199 597 1791 615304411 1845913233 5537739699 122445577789 367336733367 1102010200101