Base | Representation |
---|---|
bin | 11101011010011010000… |
… | …110110111101000000101 |
3 | 21011020010022020200200221 |
4 | 131122122012313220011 |
5 | 231103424322333333 |
6 | 4144311413504341 |
7 | 266012501362225 |
oct | 35323206675005 |
9 | 7136108220627 |
10 | 2021220121093 |
11 | 70a216079948 |
12 | 2878866420b1 |
13 | 1187a5959a44 |
14 | 6db82c22085 |
15 | 3789ae0ad2d |
hex | 1d69a1b7a05 |
2021220121093 has 2 divisors, whose sum is σ = 2021220121094. Its totient is φ = 2021220121092.
The previous prime is 2021220121091. The next prime is 2021220121133. The reversal of 2021220121093 is 3901210221202.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1341292892164 + 679927228929 = 1158142^2 + 824577^2 .
It is a cyclic number.
It is not a de Polignac number, because 2021220121093 - 21 = 2021220121091 is a prime.
It is a super-2 number, since 2×20212201210932 (a number of 25 digits) contains 22 as substring.
Together with 2021220121091, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2021220121091) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1010610060546 + 1010610060547.
It is an arithmetic number, because the mean of its divisors is an integer number (1010610060547).
Almost surely, 22021220121093 is an apocalyptic number.
It is an amenable number.
2021220121093 is a deficient number, since it is larger than the sum of its proper divisors (1).
2021220121093 is an equidigital number, since it uses as much as digits as its factorization.
2021220121093 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 25.
Adding to 2021220121093 its reverse (3901210221202), we get a palindrome (5922430342295).
The spelling of 2021220121093 in words is "two trillion, twenty-one billion, two hundred twenty million, one hundred twenty-one thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •