Base | Representation |
---|---|
bin | 1100010110100000100… |
… | …0010101110011010101 |
3 | 202021201121111221202012 |
4 | 3011220020111303111 |
5 | 11434041301230141 |
6 | 241252235154005 |
7 | 21221344522232 |
oct | 3055010256325 |
9 | 667647457665 |
10 | 212200414421 |
11 | 81aa2669126 |
12 | 351615a5905 |
13 | 17019b547c8 |
14 | a3b058c789 |
15 | 57be5d1ceb |
hex | 3168215cd5 |
212200414421 has 4 divisors (see below), whose sum is σ = 212204776032. Its totient is φ = 212196052812.
The previous prime is 212200414409. The next prime is 212200414427. The reversal of 212200414421 is 124414002212.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-212200414421 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 (212200414427) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2106995 + ... + 2205408.
It is an arithmetic number, because the mean of its divisors is an integer number (53051194008).
Almost surely, 2212200414421 is an apocalyptic number.
It is an amenable number.
212200414421 is a deficient number, since it is larger than the sum of its proper divisors (4361611).
212200414421 is an equidigital number, since it uses as much as digits as its factorization.
212200414421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4361610.
The product of its (nonzero) digits is 1024, while the sum is 23.
Adding to 212200414421 its reverse (124414002212), we get a palindrome (336614416633).
The spelling of 212200414421 in words is "two hundred twelve billion, two hundred million, four hundred fourteen thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •