Search a number
-
+
102100101111 = 3254120969419
BaseRepresentation
bin101111100010110100…
…0111110011111110111
3100202112112100112101100
41133011220332133313
53133100111213421
6114523143301143
710243064353161
oct1370550763767
9322475315340
10102100101111
113a333933158
121795514a7b3
139821934618
144d27d35931
1529c87c1c26
hex17c5a3e7f7

102100101111 has 12 divisors (see below), whose sum is σ = 147750533320. Its totient is φ = 67940914320.

The previous prime is 102100101109. The next prime is 102100101133. The reversal of 102100101111 is 111101001201.

It is not a de Polignac number, because 102100101111 - 21 = 102100101109 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 junction number, because it is equal to n+sod(n) for n = 102100101093 and 102100101102.

It is a congruent number.

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

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

Almost surely, 2102100101111 is an apocalyptic number.

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

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

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

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

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

Adding to 102100101111 its reverse (111101001201), we get a palindrome (213201102312).

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

Divisors: 1 3 9 541 1623 4869 20969419 62908257 188724771 11344455679 34033367037 102100101111