Base | Representation |
---|---|
bin | 11110100100110011011… |
… | …001000101100010000101 |
3 | 21102212022100122001211120 |
4 | 132210303121011202011 |
5 | 233411023403101041 |
6 | 4245122123024153 |
7 | 304541150466264 |
oct | 36446331054205 |
9 | 7385270561746 |
10 | 2101101222021 |
11 | 74008795632a |
12 | 29b25a66b059 |
13 | 123196261a79 |
14 | 7399dc8a5db |
15 | 399c3c40366 |
hex | 1e933645885 |
2101101222021 has 16 divisors (see below), whose sum is σ = 2849007470400. Its totient is φ = 1376965505408.
The previous prime is 2101101222019. The next prime is 2101101222023. The reversal of 2101101222021 is 1202221011012.
It is an interprime number because it is at equal distance from previous prime (2101101222019) and next prime (2101101222023).
It is a cyclic number.
It is not a de Polignac number, because 2101101222021 - 21 = 2101101222019 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2101101222023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 12771475 + ... + 12934943.
It is an arithmetic number, because the mean of its divisors is an integer number (178062966900).
Almost surely, 22101101222021 is an apocalyptic number.
It is an amenable number.
2101101222021 is a deficient number, since it is larger than the sum of its proper divisors (747906248379).
2101101222021 is a wasteful number, since it uses less digits than its factorization.
2101101222021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 236148.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 2101101222021 its reverse (1202221011012), we get a palindrome (3303322233033).
The spelling of 2101101222021 in words is "two trillion, one hundred one billion, one hundred one million, two hundred twenty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •