Base | Representation |
---|---|
bin | 110000001110011101100001… |
… | …010010011011101010010110 |
3 | 1000210222120011211111021201222 |
4 | 300032131201102123222112 |
5 | 210300021301030401324 |
6 | 2031033221301450342 |
7 | 62450501531111252 |
oct | 6016354122335226 |
9 | 1023876154437658 |
10 | 212100002200214 |
11 | 61644118896307 |
12 | 1b9564997109b2 |
13 | 9146c37a7b7ab |
14 | 3a539a2a77262 |
15 | 197c31b4d155e |
hex | c0e76149ba96 |
212100002200214 has 8 divisors (see below), whose sum is σ = 320655121436928. Its totient is φ = 105214961721240.
The previous prime is 212100002200213. The next prime is 212100002200223. The reversal of 212100002200214 is 412002200001212.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 212100002200192 and 212100002200201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (212100002200213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 417519689117 + ... + 417519689624.
It is an arithmetic number, because the mean of its divisors is an integer number (40081890179616).
Almost surely, 2212100002200214 is an apocalyptic number.
212100002200214 is a deficient number, since it is larger than the sum of its proper divisors (108555119236714).
212100002200214 is a wasteful number, since it uses less digits than its factorization.
212100002200214 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 835039378870.
The product of its (nonzero) digits is 128, while the sum is 17.
Adding to 212100002200214 its reverse (412002200001212), we get a palindrome (624102202201426).
The spelling of 212100002200214 in words is "two hundred twelve trillion, one hundred billion, two million, two hundred thousand, two hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •