Base | Representation |
---|---|
bin | 101111101111111011101101… |
… | …010010110011111011011111 |
3 | 1000112120000011021011012210220 |
4 | 233233323231102303323133 |
5 | 210011133311144231421 |
6 | 2022345345524132423 |
7 | 62143103051362200 |
oct | 5757735522637337 |
9 | 1015500137135726 |
10 | 210002112102111 |
11 | 60a054395a09aa |
12 | 1b677996537113 |
13 | 9024163b81864 |
14 | 39c022946d5a7 |
15 | 194298463a3c6 |
hex | befeed4b3edf |
210002112102111 has 24 divisors (see below), whose sum is σ = 325735542334080. Its totient is φ = 119994582444912.
The previous prime is 210002112102067. The next prime is 210002112102127. The reversal of 210002112102111 is 111201211200012.
It is a happy number.
It is not a de Polignac number, because 210002112102111 - 211 = 210002112100063 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210002112152111) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 36758821 + ... + 42085806.
It is an arithmetic number, because the mean of its divisors is an integer number (13572314263920).
Almost surely, 2210002112102111 is an apocalyptic number.
210002112102111 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
210002112102111 is a deficient number, since it is larger than the sum of its proper divisors (115733430231969).
210002112102111 is a wasteful number, since it uses less digits than its factorization.
210002112102111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 78862763 (or 78862756 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 210002112102111 its reverse (111201211200012), we get a palindrome (321203323302123).
The spelling of 210002112102111 in words is "two hundred ten trillion, two billion, one hundred twelve million, one hundred two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •