Base | Representation |
---|---|
bin | 1001001100001100001111… |
… | …10101111110101001111111 |
3 | 2122120001210122001121201211 |
4 | 10212012013311332221333 |
5 | 10122110241122431421 |
6 | 110552220350345251 |
7 | 4154063060204161 |
oct | 446060765765177 |
9 | 78501718047654 |
10 | 20210100202111 |
11 | 6492067762606 |
12 | 2324a297bb227 |
13 | b37a5bca4b61 |
14 | 4dc261906931 |
15 | 250a9edac9e1 |
hex | 126187d7ea7f |
20210100202111 has 4 divisors (see below), whose sum is σ = 20210123951424. Its totient is φ = 20210076452800.
The previous prime is 20210100202063. The next prime is 20210100202129. The reversal of 20210100202111 is 11120200101202.
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 20210100202111 - 213 = 20210100193919 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20210100202091 and 20210100202100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20210100202711) 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, 10548850 + ... + 12316591.
It is an arithmetic number, because the mean of its divisors is an integer number (5052530987856).
Almost surely, 220210100202111 is an apocalyptic number.
20210100202111 is a deficient number, since it is larger than the sum of its proper divisors (23749313).
20210100202111 is an equidigital number, since it uses as much as digits as its factorization.
20210100202111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23749312.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 20210100202111 its reverse (11120200101202), we get a palindrome (31330300303313).
The spelling of 20210100202111 in words is "twenty trillion, two hundred ten billion, one hundred million, two hundred two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •