Search a number
BaseRepresentation
bin101110100111100010…
…1001101000100001111
3100120101220112100020101
41131033011031010033
53120011404341421
6113553530231531
710142562363655
oct1351705150417
9316356470211
10100111012111
1139503069150
121749ab855a7
13959580a696
15290dd67191
hex174f14d10f

100111012111 has 4 divisors (see below), whose sum is σ = 109212013224. Its totient is φ = 91010011000.

The previous prime is 100111012109. The next prime is 100111012121. The reversal of 100111012111 is 111210111001.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 100111012111 - 21 = 100111012109 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 (100111012121) by changing a digit.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4550500540 + ... + 4550500561.

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

Almost surely, 2100111012111 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 9101001112.

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

Adding to 100111012111 its reverse (111210111001), we get a palindrome (211321123112).

The spelling of 100111012111 in words is "one hundred billion, one hundred eleven million, twelve thousand, one hundred eleven".

Divisors: 1 11 9101001101 100111012111