Base | Representation |
---|---|
bin | 11101011010010011100… |
… | …110100111001110110001 |
3 | 21011012211200220212111021 |
4 | 131122103212213032301 |
5 | 231103213404031113 |
6 | 4144252515015441 |
7 | 266010005026654 |
oct | 35322346471661 |
9 | 7135750825437 |
10 | 2021111002033 |
11 | 70a16a51a102 |
12 | 287855b9a581 |
13 | 118789172656 |
14 | 6db7253989b |
15 | 3789155448d |
hex | 1d6939a73b1 |
2021111002033 has 2 divisors, whose sum is σ = 2021111002034. Its totient is φ = 2021111002032.
The previous prime is 2021111002003. The next prime is 2021111002139. The reversal of 2021111002033 is 3302001111202.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1349853596224 + 671257405809 = 1161832^2 + 819303^2 .
It is a cyclic number.
It is not a de Polignac number, because 2021111002033 - 237 = 1883672048561 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2021111001998 and 2021111002016.
It is not a weakly prime, because it can be changed into another prime (2021111002003) 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, 1010555501016 + 1010555501017.
It is an arithmetic number, because the mean of its divisors is an integer number (1010555501017).
Almost surely, 22021111002033 is an apocalyptic number.
It is an amenable number.
2021111002033 is a deficient number, since it is larger than the sum of its proper divisors (1).
2021111002033 is an equidigital number, since it uses as much as digits as its factorization.
2021111002033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 2021111002033 its reverse (3302001111202), we get a palindrome (5323112113235).
The spelling of 2021111002033 in words is "two trillion, twenty-one billion, one hundred eleven million, two thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •