Search a number
-
+
100011201101 = 7113757167023
BaseRepresentation
bin101110100100100100…
…0011101001001001101
3100120010221201102021022
41131021020131021031
53114310331413401
6113540003043525
710140241116530
oct1351110351115
9316127642238
10100011201101
1139461796709
12174716705a5
13957ac31c06
144baa738a17
1529051ed71b
hex174921d24d

100011201101 has 16 divisors (see below), whose sum is σ = 115463023104. Its totient is φ = 84852520704.

The previous prime is 100011201083. The next prime is 100011201131. The reversal of 100011201101 is 101102110001.

It is a happy number.

It is not a de Polignac number, because 100011201101 - 230 = 98937459277 is a prime.

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

It is a Duffinian number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (100011201131) 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 15 ways as a sum of consecutive naturals, for example, 515276 + ... + 682298.

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

Almost surely, 2100011201101 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 167900.

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

Adding to 100011201101 its reverse (101102110001), we get a palindrome (201113311102).

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

Divisors: 1 7 113 757 791 5299 85541 167023 598787 1169161 18873599 126436411 132115193 885054877 14287314443 100011201101