Base | Representation |
---|---|
bin | 10010101110001011… |
… | …000011000111010111 |
3 | 1220212221110110110200 |
4 | 102232023003013113 |
5 | 312132103013421 |
6 | 13122411351543 |
7 | 1311101122143 |
oct | 225613030727 |
9 | 56787413420 |
10 | 20102001111 |
11 | 8586067a65 |
12 | 3a901525b3 |
13 | 1b8486c21a |
14 | d89a78223 |
15 | 7c9bb8726 |
hex | 4ae2c31d7 |
20102001111 has 6 divisors (see below), whose sum is σ = 29036223840. Its totient is φ = 13401334068.
The previous prime is 20102001103. The next prime is 20102001211. The reversal of 20102001111 is 11110020102.
It is a happy number.
It is not a de Polignac number, because 20102001111 - 23 = 20102001103 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9), and also a Moran number because the ratio is a prime number: 2233555679 = 20102001111 / (2 + 0 + 1 + 0 + 2 + 0 + 0 + 1 + 1 + 1 + 1).
It is a junction number, because it is equal to n+sod(n) for n = 20102001093 and 20102001102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20102001211) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1116777831 + ... + 1116777848.
It is an arithmetic number, because the mean of its divisors is an integer number (4839370640).
Almost surely, 220102001111 is an apocalyptic number.
20102001111 is a deficient number, since it is larger than the sum of its proper divisors (8934222729).
20102001111 is a wasteful number, since it uses less digits than its factorization.
20102001111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2233555685 (or 2233555682 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 20102001111 its reverse (11110020102), we get a palindrome (31212021213).
The spelling of 20102001111 in words is "twenty billion, one hundred two million, one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •