Search a number
-
+
20100210111 = 3214914988971
BaseRepresentation
bin10010101110000100…
…001101110110111111
31220212211002110200100
4102232010031312333
5312131123210421
613122305132143
71311046652442
oct225604156677
956784073610
1020100210111
1185850543a3
123a8b62a053
131b84392c67
14d8972d659
157c9962c26
hex4ae10ddbf

20100210111 has 12 divisors (see below), whose sum is σ = 29228495400. Its totient is φ = 13310205360.

The previous prime is 20100210103. The next prime is 20100210127. The reversal of 20100210111 is 11101200102.

It is a happy number.

It is not a de Polignac number, because 20100210111 - 23 = 20100210103 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (9).

It is a junction number, because it is equal to n+sod(n) for n = 20100210093 and 20100210102.

It is a congruent number.

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

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

Almost surely, 220100210111 is an apocalyptic number.

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

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

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

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

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

Adding to 20100210111 its reverse (11101200102), we get a palindrome (31201410213).

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

Divisors: 1 3 9 149 447 1341 14988971 44966913 134900739 2233356679 6700070037 20100210111