Base | Representation |
---|---|
bin | 110011010100111010… |
… | …0101000101110100101 |
3 | 101112111122122022211110 |
4 | 1212221310220232211 |
5 | 3301214133031323 |
6 | 122345204255233 |
7 | 10651302563643 |
oct | 1465164505645 |
9 | 345448568743 |
10 | 110223330213 |
11 | 42822218437 |
12 | 194416a1519 |
13 | a517862369 |
14 | 5498b1a193 |
15 | 2d01a0e793 |
hex | 19a9d28ba5 |
110223330213 has 8 divisors (see below), whose sum is σ = 148265011008. Its totient is φ = 72831934784.
The previous prime is 110223330211. The next prime is 110223330227. The reversal of 110223330213 is 312033322011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 110223330213 - 21 = 110223330211 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 110223330213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110223330211) 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 7 ways as a sum of consecutive naturals, for example, 162570945 + ... + 162571622.
It is an arithmetic number, because the mean of its divisors is an integer number (18533126376).
Almost surely, 2110223330213 is an apocalyptic number.
It is an amenable number.
110223330213 is a deficient number, since it is larger than the sum of its proper divisors (38041680795).
110223330213 is a wasteful number, since it uses less digits than its factorization.
110223330213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 325142683.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 110223330213 its reverse (312033322011), we get a palindrome (422256652224).
The spelling of 110223330213 in words is "one hundred ten billion, two hundred twenty-three million, three hundred thirty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •