Search a number
-
+
101020111111 = 212947449559
BaseRepresentation
bin101111000010101000…
…1001001000100000111
3100122202021011100121201
41132011101021010013
53123342122023421
6114224043323331
710204241530243
oct1360521110407
9318667140551
10101020111111
113992a245737
12176b3520547
1396abc6b79a
144c64725423
152963a8eb91
hex1785449107

101020111111 has 4 divisors (see below), whose sum is σ = 101067562800. Its totient is φ = 100972659424.

The previous prime is 101020111097. The next prime is 101020111123. The reversal of 101020111111 is 111111020101.

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 101020111111 - 211 = 101020109063 is a prime.

It is a Duffinian number.

101020111111 is a modest number, since divided by 111111 gives 101020 as remainder.

It is a congruent number.

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

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

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

Almost surely, 2101020111111 is an apocalyptic number.

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

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

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

The sum of its prime factors is 47451688.

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

Adding to 101020111111 its reverse (111111020101), we get a palindrome (212131131212).

The spelling of 101020111111 in words is "one hundred one billion, twenty million, one hundred eleven thousand, one hundred eleven".

Divisors: 1 2129 47449559 101020111111