Base | Representation |
---|---|
bin | 1001001001000010111010… |
… | …10010101000010100011111 |
3 | 2122011201210210020122002011 |
4 | 10210201131102220110133 |
5 | 10113322410100010421 |
6 | 110430423055412051 |
7 | 4143215412450421 |
oct | 444413522502437 |
9 | 78151723218064 |
10 | 20102012110111 |
11 | 6450240861258 |
12 | 2307aa3224027 |
13 | b2a7c491a979 |
14 | 4d6d2a60a811 |
15 | 24cd75a764e1 |
hex | 12485d4a851f |
20102012110111 has 4 divisors (see below), whose sum is σ = 20103511043224. Its totient is φ = 20100513177000.
The previous prime is 20102012110097. The next prime is 20102012110129. The reversal of 20102012110111 is 11101121020102.
It is a happy number.
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 20102012110111 - 211 = 20102012108063 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20102012110091 and 20102012110100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20102012110511) 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, 749446440 + ... + 749473261.
It is an arithmetic number, because the mean of its divisors is an integer number (5025877760806).
Almost surely, 220102012110111 is an apocalyptic number.
20102012110111 is a deficient number, since it is larger than the sum of its proper divisors (1498933113).
20102012110111 is a wasteful number, since it uses less digits than its factorization.
20102012110111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1498933112.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 20102012110111 its reverse (11101121020102), we get a palindrome (31203133130213).
The spelling of 20102012110111 in words is "twenty trillion, one hundred two billion, twelve million, one hundred ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.169 sec. • engine limits •