Base | Representation |
---|---|
bin | 11101011010100101101… |
… | …011001110101100000001 |
3 | 21011020121211110000210212 |
4 | 131122211223032230001 |
5 | 231104324013431423 |
6 | 4144342545403505 |
7 | 266020346135135 |
oct | 35324553165401 |
9 | 7136554400725 |
10 | 2021414202113 |
11 | 70a305689889 |
12 | 28791b639595 |
13 | 118806c20b97 |
14 | 6dba09033c5 |
15 | 378ace96578 |
hex | 1d6a5aceb01 |
2021414202113 has 4 divisors (see below), whose sum is σ = 2021417917440. Its totient is φ = 2021410486788.
The previous prime is 2021414202047. The next prime is 2021414202133. The reversal of 2021414202113 is 3112024141202.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 2021414202113 - 230 = 2020340460289 is a prime.
It is a super-2 number, since 2×20214142021132 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2021414202133) 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, 864593 + ... + 2188686.
It is an arithmetic number, because the mean of its divisors is an integer number (505354479360).
Almost surely, 22021414202113 is an apocalyptic number.
It is an amenable number.
2021414202113 is a deficient number, since it is larger than the sum of its proper divisors (3715327).
2021414202113 is an equidigital number, since it uses as much as digits as its factorization.
2021414202113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3715326.
The product of its (nonzero) digits is 768, while the sum is 23.
Adding to 2021414202113 its reverse (3112024141202), we get a palindrome (5133438343315).
The spelling of 2021414202113 in words is "two trillion, twenty-one billion, four hundred fourteen million, two hundred two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •