Base | Representation |
---|---|
bin | 110000001110100110111100… |
… | …011110011010001001111101 |
3 | 1000211000112022002200102200021 |
4 | 300032212330132122021331 |
5 | 210300203012213013041 |
6 | 2031042013404132141 |
7 | 62451310362024556 |
oct | 6016467436321175 |
9 | 1024015262612607 |
10 | 212110122001021 |
11 | 61648441196452 |
12 | 1b958442837051 |
13 | 9147b8b5232ca |
14 | 3a54282aa332d |
15 | 197c70eb55cd1 |
hex | c0e9bc79a27d |
212110122001021 has 16 divisors (see below), whose sum is σ = 218317282848000. Its totient is φ = 205952222649600.
The previous prime is 212110122001009. The next prime is 212110122001039. The reversal of 212110122001021 is 120100221011212.
It is a cyclic number.
It is not a de Polignac number, because 212110122001021 - 217 = 212110121869949 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 212110122000986 and 212110122001004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (212110122001091) 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, 556925385 + ... + 557306113.
It is an arithmetic number, because the mean of its divisors is an integer number (13644830178000).
Almost surely, 2212110122001021 is an apocalyptic number.
It is an amenable number.
212110122001021 is a deficient number, since it is larger than the sum of its proper divisors (6207160846979).
212110122001021 is a wasteful number, since it uses less digits than its factorization.
212110122001021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 445380.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 212110122001021 its reverse (120100221011212), we get a palindrome (332210343012233).
The spelling of 212110122001021 in words is "two hundred twelve trillion, one hundred ten billion, one hundred twenty-two million, one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •