Base | Representation |
---|---|
bin | 1100110011111110110… |
… | …0101011101111100101 |
3 | 210001010222120122212120 |
4 | 3030333230223233211 |
5 | 12101242133311323 |
6 | 245041300140153 |
7 | 21621403134204 |
oct | 3147754535745 |
9 | 701128518776 |
10 | 220112010213 |
11 | 85392545147 |
12 | 367ab097659 |
13 | 179aac84134 |
14 | a92120323b |
15 | 5ad3e685e3 |
hex | 333fb2bbe5 |
220112010213 has 8 divisors (see below), whose sum is σ = 301414644768. Its totient is φ = 142775357904.
The previous prime is 220112010191. The next prime is 220112010227. The reversal of 220112010213 is 312010211022.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 220112010213 - 210 = 220112009189 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 220112010192 and 220112010201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (220112011213) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 991495431 + ... + 991495652.
It is an arithmetic number, because the mean of its divisors is an integer number (37676830596).
Almost surely, 2220112010213 is an apocalyptic number.
It is an amenable number.
220112010213 is a deficient number, since it is larger than the sum of its proper divisors (81302634555).
220112010213 is a wasteful number, since it uses less digits than its factorization.
220112010213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1982991123.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 220112010213 its reverse (312010211022), we get a palindrome (532122221235).
The spelling of 220112010213 in words is "two hundred twenty billion, one hundred twelve million, ten thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •