Base | Representation |
---|---|
bin | 11101011011010100101… |
… | …000110100110101101101 |
3 | 21011022122202000110000212 |
4 | 131123110220310311231 |
5 | 231112432214213401 |
6 | 4144553053032205 |
7 | 266046024151550 |
oct | 35332450646555 |
9 | 7138582013025 |
10 | 2022202101101 |
11 | 70a67a404a76 |
12 | 287abb485665 |
13 | 118901227ac0 |
14 | 6dc373dc697 |
15 | 3790722cdbb |
hex | 1d6d4a34d6d |
2022202101101 has 32 divisors (see below), whose sum is σ = 2495195431680. Its totient is φ = 1595916504576.
The previous prime is 2022202101061. The next prime is 2022202101103. The reversal of 2022202101101 is 1011012022202.
It is a cyclic number.
It is not a de Polignac number, because 2022202101101 - 210 = 2022202100077 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2022202101103) 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 31 ways as a sum of consecutive naturals, for example, 147502235 + ... + 147515943.
It is an arithmetic number, because the mean of its divisors is an integer number (77974857240).
Almost surely, 22022202101101 is an apocalyptic number.
It is an amenable number.
2022202101101 is a deficient number, since it is larger than the sum of its proper divisors (472993330579).
2022202101101 is a wasteful number, since it uses less digits than its factorization.
2022202101101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17733.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 2022202101101 its reverse (1011012022202), we get a palindrome (3033214123303).
It can be divided in two parts, 2022202 and 101101, that multiplied together give a palindrome (204446644402).
The spelling of 2022202101101 in words is "two trillion, twenty-two billion, two hundred two million, one hundred one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •