Search a number
-
+
101001211101 = 3271603193827
BaseRepresentation
bin101111000010000100…
…1000010110011011101
3100122200221121010200100
41132010021002303131
53123322302223401
6114222130251313
710203622062210
oct1360411026335
9318627533610
10101001211101
113991a60689a
12176a9126b39
1396a8081c4b
144c62005777
1529620a9b86
hex1784242cdd

101001211101 has 12 divisors (see below), whose sum is σ = 166732158112. Its totient is φ = 57714977736.

The previous prime is 101001211081. The next prime is 101001211109. The reversal of 101001211101 is 101112100101.

It is not a de Polignac number, because 101001211101 - 217 = 101001080029 is a prime.

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

It is a Duffinian number.

It is a Curzon number.

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

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

Almost surely, 2101001211101 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

Adding to 101001211101 its reverse (101112100101), we get a palindrome (202113311202).

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

Divisors: 1 3 7 9 21 63 1603193827 4809581481 11222356789 14428744443 33667070367 101001211101