Base | Representation |
---|---|
bin | 11110100100111001010… |
… | …010101101000011111101 |
3 | 21102212120020220021212021 |
4 | 132210321102231003331 |
5 | 233411224223242341 |
6 | 4245140020440141 |
7 | 304543462054405 |
oct | 36447122550375 |
9 | 7385506807767 |
10 | 2101200212221 |
11 | 740128818110 |
12 | 29b287849051 |
13 | 1231b0910a56 |
14 | 739ad097805 |
15 | 399cc7959d1 |
hex | 1e9394ad0fd |
2101200212221 has 16 divisors (see below), whose sum is σ = 2331709286400. Its totient is φ = 1877290721200.
The previous prime is 2101200212213. The next prime is 2101200212249. The reversal of 2101200212221 is 1222120021012.
It is a happy number.
It is not a de Polignac number, because 2101200212221 - 23 = 2101200212213 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2101200212195 and 2101200212204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2101200212621) 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 15 ways as a sum of consecutive naturals, for example, 1932276 + ... + 2817106.
It is an arithmetic number, because the mean of its divisors is an integer number (145731830400).
Almost surely, 22101200212221 is an apocalyptic number.
It is an amenable number.
2101200212221 is a deficient number, since it is larger than the sum of its proper divisors (230509074179).
2101200212221 is a wasteful number, since it uses less digits than its factorization.
2101200212221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 888560.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 2101200212221 its reverse (1222120021012), we get a palindrome (3323320233233).
The spelling of 2101200212221 in words is "two trillion, one hundred one billion, two hundred million, two hundred twelve thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •