Base | Representation |
---|---|
bin | 11101011010010011101… |
… | …110101101000111111001 |
3 | 21011012211211220122100111 |
4 | 131122103232231013321 |
5 | 231103214424421241 |
6 | 4144253032304321 |
7 | 266010032043325 |
oct | 35322356550771 |
9 | 7135754818314 |
10 | 2021113123321 |
11 | 70a170738936 |
12 | 2878568420a1 |
13 | 118789736056 |
14 | 6db7292c985 |
15 | 37891822c81 |
hex | 1d693bad1f9 |
2021113123321 has 2 divisors, whose sum is σ = 2021113123322. Its totient is φ = 2021113123320.
The previous prime is 2021113123319. The next prime is 2021113123453. The reversal of 2021113123321 is 1233213111202.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1532247865600 + 488865257721 = 1237840^2 + 699189^2 .
It is a cyclic number.
It is not a de Polignac number, because 2021113123321 - 21 = 2021113123319 is a prime.
Together with 2021113123319, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 2021113123292 and 2021113123301.
It is not a weakly prime, because it can be changed into another prime (2021113123621) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1010556561660 + 1010556561661.
It is an arithmetic number, because the mean of its divisors is an integer number (1010556561661).
Almost surely, 22021113123321 is an apocalyptic number.
It is an amenable number.
2021113123321 is a deficient number, since it is larger than the sum of its proper divisors (1).
2021113123321 is an equidigital number, since it uses as much as digits as its factorization.
2021113123321 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 2021113123321 its reverse (1233213111202), we get a palindrome (3254326234523).
The spelling of 2021113123321 in words is "two trillion, twenty-one billion, one hundred thirteen million, one hundred twenty-three thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •