Base | Representation |
---|---|
bin | 1100010010110100011… |
… | …0010000111000001111 |
3 | 202012011120220102002101 |
4 | 3010231012100320033 |
5 | 11430024230423343 |
6 | 241010055335531 |
7 | 21154660333135 |
oct | 3045506207017 |
9 | 665146812071 |
10 | 211210014223 |
11 | 8163460186a |
12 | 34b259815a7 |
13 | 16bbc8c8ca0 |
14 | a318c1d755 |
15 | 5762699e4d |
hex | 312d190e0f |
211210014223 has 4 divisors (see below), whose sum is σ = 227456938408. Its totient is φ = 194963090040.
The previous prime is 211210014217. The next prime is 211210014227. The reversal of 211210014223 is 322410012112.
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 211210014223 - 229 = 210673143311 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 211210014223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211210014227) 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, 8123462073 + ... + 8123462098.
It is an arithmetic number, because the mean of its divisors is an integer number (56864234602).
Almost surely, 2211210014223 is an apocalyptic number.
211210014223 is a deficient number, since it is larger than the sum of its proper divisors (16246924185).
211210014223 is a wasteful number, since it uses less digits than its factorization.
211210014223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16246924184.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 211210014223 its reverse (322410012112), we get a palindrome (533620026335).
The spelling of 211210014223 in words is "two hundred eleven billion, two hundred ten million, fourteen thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •