Base | Representation |
---|---|
bin | 110000001101001011100100… |
… | …000101000100101010010011 |
3 | 1000210200011000221222002211121 |
4 | 300031023210011010222103 |
5 | 210242101040030401321 |
6 | 2030524545204223111 |
7 | 62441235025336423 |
oct | 6015134405045223 |
9 | 1023604027862747 |
10 | 212012002200211 |
11 | 6160a870111884 |
12 | 1b94141a69aa97 |
13 | 913b852403885 |
14 | 3a4d615634483 |
15 | 1979dbaa17441 |
hex | c0d2e4144a93 |
212012002200211 has 8 divisors (see below), whose sum is σ = 219324060979200. Its totient is φ = 204700030093440.
The previous prime is 212012002200161. The next prime is 212012002200217. The reversal of 212012002200211 is 112002200210212.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 212012002200211 - 211 = 212012002198163 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (212012002200217) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 16671891 + ... + 26494828.
It is an arithmetic number, because the mean of its divisors is an integer number (27415507622400).
Almost surely, 2212012002200211 is an apocalyptic number.
212012002200211 is a deficient number, since it is larger than the sum of its proper divisors (7312058778989).
212012002200211 is a wasteful number, since it uses less digits than its factorization.
212012002200211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43336109.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 212012002200211 its reverse (112002200210212), we get a palindrome (324014202410423).
The spelling of 212012002200211 in words is "two hundred twelve trillion, twelve billion, two million, two hundred thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •