Base | Representation |
---|---|
bin | 110000001101001001111000… |
… | …101110011011001011011101 |
3 | 1000210122222101102212210020012 |
4 | 300031021320232123023131 |
5 | 210242033342440213041 |
6 | 2030524050344333005 |
7 | 62441142265263401 |
oct | 6015117056331335 |
9 | 1023588342783205 |
10 | 212010201101021 |
11 | 6160a026477354 |
12 | 1b940bb7474165 |
13 | 913b62621a3cb |
14 | 3a4d4c4353101 |
15 | 1979d128433eb |
hex | c0d278b9b2dd |
212010201101021 has 16 divisors (see below), whose sum is σ = 217036908337920. Its totient is φ = 206987878319040.
The previous prime is 212010201100993. The next prime is 212010201101029. The reversal of 212010201101021 is 120101102010212.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-212010201101021 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 212010201100987 and 212010201101005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (212010201101029) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2176133516 + ... + 2176230938.
It is an arithmetic number, because the mean of its divisors is an integer number (13564806771120).
Almost surely, 2212010201101021 is an apocalyptic number.
It is an amenable number.
212010201101021 is a deficient number, since it is larger than the sum of its proper divisors (5026707236899).
212010201101021 is a wasteful number, since it uses less digits than its factorization.
212010201101021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 119396.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 212010201101021 its reverse (120101102010212), we get a palindrome (332111303111233).
The spelling of 212010201101021 in words is "two hundred twelve trillion, ten billion, two hundred one million, one hundred one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •