Base | Representation |
---|---|
bin | 110011010100110100… |
… | …0110010001011101101 |
3 | 101112111102210110211101 |
4 | 1212221220302023231 |
5 | 3301212334120323 |
6 | 122345013523101 |
7 | 10651234303432 |
oct | 1465150621355 |
9 | 345442713741 |
10 | 110220223213 |
11 | 42820496071 |
12 | 19440643491 |
13 | a5170150b9 |
14 | 549854bb89 |
15 | 2d015e8dad |
hex | 19a9a322ed |
110220223213 has 4 divisors (see below), whose sum is σ = 110246352160. Its totient is φ = 110194094268.
The previous prime is 110220223189. The next prime is 110220223219. The reversal of 110220223213 is 312322022011.
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 not a de Polignac number, because 110220223213 - 229 = 109683352301 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 (110220223219) 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 3 ways as a sum of consecutive naturals, for example, 13058145 + ... + 13066582.
It is an arithmetic number, because the mean of its divisors is an integer number (27561588040).
Almost surely, 2110220223213 is an apocalyptic number.
It is an amenable number.
110220223213 is a deficient number, since it is larger than the sum of its proper divisors (26128947).
110220223213 is an equidigital number, since it uses as much as digits as its factorization.
110220223213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26128946.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 110220223213 its reverse (312322022011), we get a palindrome (422542245224).
The spelling of 110220223213 in words is "one hundred ten billion, two hundred twenty million, two hundred twenty-three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •