Base | Representation |
---|---|
bin | 11101011011001111110… |
… | …011100010001010010101 |
3 | 21011022110002110012112221 |
4 | 131123033303202022111 |
5 | 231112300440201401 |
6 | 4144541035142341 |
7 | 266044021042615 |
oct | 35331763421225 |
9 | 7138402405487 |
10 | 2022121022101 |
11 | 70a638667134 |
12 | 287a982a49b1 |
13 | 1188ba4aa56b |
14 | 6dc2a734a45 |
15 | 379000647a1 |
hex | 1d6cfce2295 |
2022121022101 has 8 divisors (see below), whose sum is σ = 2033553888000. Its totient is φ = 2010718204320.
The previous prime is 2022121022057. The next prime is 2022121022111. The reversal of 2022121022101 is 1012201212202.
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 not a de Polignac number, because 2022121022101 - 29 = 2022121021589 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2022121022111) 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 in 7 ways as a sum of consecutive naturals, for example, 7377051 + ... + 7646248.
It is an arithmetic number, because the mean of its divisors is an integer number (254194236000).
Almost surely, 22022121022101 is an apocalyptic number.
It is an amenable number.
2022121022101 is a deficient number, since it is larger than the sum of its proper divisors (11432865899).
2022121022101 is a wasteful number, since it uses less digits than its factorization.
2022121022101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15024059.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 2022121022101 its reverse (1012201212202), we get a palindrome (3034322234303).
The spelling of 2022121022101 in words is "two trillion, twenty-two billion, one hundred twenty-one million, twenty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •