Base | Representation |
---|---|
bin | 11101011010010010111… |
… | …101000010000101111011 |
3 | 21011012210221102002110202 |
4 | 131122102331002011323 |
5 | 231103203111231021 |
6 | 4144251445232415 |
7 | 266006513261324 |
oct | 35322275020573 |
9 | 7135727362422 |
10 | 2021100102011 |
11 | 70a164354821 |
12 | 28785240270b |
13 | 118786b27233 |
14 | 6db70cdd44b |
15 | 378905eea0b |
hex | 1d692f4217b |
2021100102011 has 4 divisors (see below), whose sum is σ = 2030163331392. Its totient is φ = 2012036872632.
The previous prime is 2021100101989. The next prime is 2021100102023. The reversal of 2021100102011 is 1102010011202.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2021100102011 is a prime.
It is a super-3 number, since 3×20211001020113 (a number of 38 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2021100101983 and 2021100102001.
It is not an unprimeable number, because it can be changed into a prime (2021100102031) 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, 4531614356 + ... + 4531614801.
It is an arithmetic number, because the mean of its divisors is an integer number (507540832848).
Almost surely, 22021100102011 is an apocalyptic number.
2021100102011 is a deficient number, since it is larger than the sum of its proper divisors (9063229381).
2021100102011 is an equidigital number, since it uses as much as digits as its factorization.
2021100102011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9063229380.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 2021100102011 its reverse (1102010011202), we get a palindrome (3123110113213).
The spelling of 2021100102011 in words is "two trillion, twenty-one billion, one hundred million, one hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •