Base | Representation |
---|---|
bin | 11001100011110… |
… | …00110001111111 |
3 | 112221102212022011 |
4 | 30301320301333 |
5 | 414341413343 |
6 | 33135232051 |
7 | 5212256125 |
oct | 1461706177 |
9 | 487385264 |
10 | 214404223 |
11 | 100031080 |
12 | 5b978627 |
13 | 3555b707 |
14 | 20691915 |
15 | 13c5229d |
hex | cc78c7f |
214404223 has 4 divisors (see below), whose sum is σ = 233895528. Its totient is φ = 194912920.
The previous prime is 214404193. The next prime is 214404247. The reversal of 214404223 is 322404412.
It is a happy number.
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 214404223 - 25 = 214404191 is a prime.
It is a Duffinian number.
It is a zygodrome in base 2.
It is a junction number, because it is equal to n+sod(n) for n = 214404194 and 214404203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (214404523) 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, 9745636 + ... + 9745657.
It is an arithmetic number, because the mean of its divisors is an integer number (58473882).
Almost surely, 2214404223 is an apocalyptic number.
214404223 is a deficient number, since it is larger than the sum of its proper divisors (19491305).
214404223 is a wasteful number, since it uses less digits than its factorization.
214404223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19491304.
The product of its (nonzero) digits is 1536, while the sum is 22.
The square root of 214404223 is about 14642.5483779293. The cubic root of 214404223 is about 598.5187750003.
Adding to 214404223 its reverse (322404412), we get a palindrome (536808635).
The spelling of 214404223 in words is "two hundred fourteen million, four hundred four thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •