Search a number
-
+
101200211101 = 112836365381
BaseRepresentation
bin101111001000000000…
…0001010110010011101
3100200012211001101100201
41132100000022302131
53124224223223401
6114253555423501
710211556413143
oct1362000126235
9320184041321
10101200211101
1139a11976500
12177438b4b91
13970a379022
144c80607593
1529747b7b01
hex179000ac9d

101200211101 has 6 divisors (see below), whose sum is σ = 111236595806. Its totient is φ = 92000191800.

The previous prime is 101200211069. The next prime is 101200211173. The reversal of 101200211101 is 101112002101.

It can be written as a sum of positive squares in only one way, i.e., 91114026201 + 10086184900 = 301851^2 + 100430^2 .

It is not a de Polignac number, because 101200211101 - 25 = 101200211069 is a prime.

It is a Duffinian number.

It is a congruent number.

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

It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 418182570 + ... + 418182811.

Almost surely, 2101200211101 is an apocalyptic number.

101200211101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.

It is an amenable number.

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

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

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

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

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

Adding to 101200211101 its reverse (101112002101), we get a palindrome (202312213202).

The spelling of 101200211101 in words is "one hundred one billion, two hundred million, two hundred eleven thousand, one hundred one".

Divisors: 1 11 121 836365381 9200019191 101200211101