Base | Representation |
---|---|
bin | 110000001110100110110110… |
… | …011010000100011000111111 |
3 | 1000211000112001000010101221001 |
4 | 300032212312122010120333 |
5 | 210300202310132344444 |
6 | 2031041555330151131 |
7 | 62451305014521565 |
oct | 6016466632043077 |
9 | 1024015030111831 |
10 | 212110020199999 |
11 | 61648399784879 |
12 | 1b9584147224a7 |
13 | 9147b733cbb0c |
14 | 3a54273363a35 |
15 | 197c705c478d4 |
hex | c0e9b668463f |
212110020199999 has 4 divisors (see below), whose sum is σ = 218952278916160. Its totient is φ = 205267761483840.
The previous prime is 212110020199993. The next prime is 212110020200009. The reversal of 212110020199999 is 999991020011212.
212110020199999 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 212110020199999 - 211 = 212110020197951 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (212110020199993) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3421129358034 + ... + 3421129358095.
It is an arithmetic number, because the mean of its divisors is an integer number (54738069729040).
Almost surely, 2212110020199999 is an apocalyptic number.
212110020199999 is a deficient number, since it is larger than the sum of its proper divisors (6842258716161).
212110020199999 is an equidigital number, since it uses as much as digits as its factorization.
212110020199999 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6842258716160.
The product of its (nonzero) digits is 472392, while the sum is 55.
The spelling of 212110020199999 in words is "two hundred twelve trillion, one hundred ten billion, twenty million, one hundred ninety-nine thousand, nine hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •