Base | Representation |
---|---|
bin | 11101011011001001110… |
… | …110000001011100010101 |
3 | 21011022012010021010102021 |
4 | 131123021312001130111 |
5 | 231112044334324341 |
6 | 4144523103413141 |
7 | 266041365003661 |
oct | 35331166013425 |
9 | 7138163233367 |
10 | 2022021011221 |
11 | 70a597168512 |
12 | 287a6a8b41b1 |
13 | 1188a2861b23 |
14 | 6dc1b33d8a1 |
15 | 378e63ab9d1 |
hex | 1d6c9d81715 |
2022021011221 has 8 divisors (see below), whose sum is σ = 2113066986624. Its totient is φ = 1932976046400.
The previous prime is 2022021011209. The next prime is 2022021011251. The reversal of 2022021011221 is 1221101202202.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2022021011221 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2022021011195 and 2022021011204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2022021011251) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 500250580 + ... + 500254621.
It is an arithmetic number, because the mean of its divisors is an integer number (264133373328).
Almost surely, 22022021011221 is an apocalyptic number.
It is an amenable number.
2022021011221 is a deficient number, since it is larger than the sum of its proper divisors (91045975403).
2022021011221 is a wasteful number, since it uses less digits than its factorization.
2022021011221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1000505291.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 2022021011221 its reverse (1221101202202), we get a palindrome (3243122213423).
The spelling of 2022021011221 in words is "two trillion, twenty-two billion, twenty-one million, eleven thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.115 sec. • engine limits •