Base | Representation |
---|---|
bin | 110000001110100110110110… |
… | …011001101011111110101011 |
3 | 1000211000112000222221022202210 |
4 | 300032212312121223332223 |
5 | 210300202310121200021 |
6 | 2031041555324100203 |
7 | 62451305013624225 |
oct | 6016466631537653 |
9 | 1024015028838683 |
10 | 212110020100011 |
11 | 61648399716740 |
12 | 1b958414694663 |
13 | 9147b73395457 |
14 | 3a54273339415 |
15 | 197c705c27e76 |
hex | c0e9b666bfab |
212110020100011 has 64 divisors (see below), whose sum is σ = 344250256628736. Its totient is φ = 114583417344000.
The previous prime is 212110020099959. The next prime is 212110020100021. The reversal of 212110020100011 is 110001020011212.
It is not a de Polignac number, because 212110020100011 - 27 = 212110020099883 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 212110020100011.
It is not an unprimeable number, because it can be changed into a prime (212110020100021) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 80077066 + ... + 82683471.
It is an arithmetic number, because the mean of its divisors is an integer number (5378910259824).
Almost surely, 2212110020100011 is an apocalyptic number.
212110020100011 is a deficient number, since it is larger than the sum of its proper divisors (132140236528725).
212110020100011 is a wasteful number, since it uses less digits than its factorization.
212110020100011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 162760692.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 212110020100011 its reverse (110001020011212), we get a palindrome (322111040111223).
It can be divided in two parts, 2121100 and 20100011, that added together give a triangular number (22221111 = T6666).
The spelling of 212110020100011 in words is "two hundred twelve trillion, one hundred ten billion, twenty million, one hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •