Search a number
-
+
100210101111 = 32102019109141
BaseRepresentation
bin101110101010011111…
…1001100101101110111
3100120122210222120210100
41131110333030231313
53120212241213421
6114011430125143
710145204543121
oct1352477145567
9316583876710
10100210101111
1139553a9818a
12175081b07b3
1395b01c2623
144bc8d12211
1529178dbc26
hex1754fccb77

100210101111 has 12 divisors (see below), whose sum is σ = 144750668920. Its totient is φ = 66805467120.

The previous prime is 100210101077. The next prime is 100210101113. The reversal of 100210101111 is 111101012001.

It is not a de Polignac number, because 100210101111 - 219 = 100209576823 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 = 100210101093 and 100210101102.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (100210101113) 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, 863601 + ... + 972741.

Almost surely, 2100210101111 is an apocalyptic number.

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

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

100210101111 is an evil number, because the sum of its binary digits is even.

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

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

Adding to 100210101111 its reverse (111101012001), we get a palindrome (211311113112).

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

Divisors: 1 3 9 102019 109141 306057 327423 918171 982269 11134455679 33403367037 100210101111