Base | Representation |
---|---|
bin | 11101011010011000111… |
… | …110011001011100101001 |
3 | 21011020001222111111101001 |
4 | 131122120332121130221 |
5 | 231103404441414423 |
6 | 4144305454355001 |
7 | 266012151035434 |
oct | 35323076313451 |
9 | 7136058444331 |
10 | 2021201123113 |
11 | 70a206383437 |
12 | 2878801bba61 |
13 | 1187a1a37733 |
14 | 6db804b881b |
15 | 37899406cad |
hex | 1d698f99729 |
2021201123113 has 2 divisors, whose sum is σ = 2021201123114. Its totient is φ = 2021201123112.
The previous prime is 2021201123111. The next prime is 2021201123159. The reversal of 2021201123113 is 3113211021202.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1594391086864 + 426810036249 = 1262692^2 + 653307^2 .
It is a cyclic number.
It is not a de Polignac number, because 2021201123113 - 21 = 2021201123111 is a prime.
Together with 2021201123111, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (2021201123111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1010600561556 + 1010600561557.
It is an arithmetic number, because the mean of its divisors is an integer number (1010600561557).
Almost surely, 22021201123113 is an apocalyptic number.
It is an amenable number.
2021201123113 is a deficient number, since it is larger than the sum of its proper divisors (1).
2021201123113 is an equidigital number, since it uses as much as digits as its factorization.
2021201123113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 2021201123113 its reverse (3113211021202), we get a palindrome (5134412144315).
The spelling of 2021201123113 in words is "two trillion, twenty-one billion, two hundred one million, one hundred twenty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.198 sec. • engine limits •