Base | Representation |
---|---|
bin | 1011000111010011110111… |
… | …1100000001010000111001 |
3 | 1121021020112012221011020201 |
4 | 2301310331330001100321 |
5 | 3100204003100213423 |
6 | 41553520404322201 |
7 | 2400611320334044 |
oct | 261647574012071 |
9 | 47236465834221 |
10 | 12220221101113 |
11 | 399162625a613 |
12 | 145443b3a3361 |
13 | 6a849214b33c |
14 | 30366749bc5b |
15 | 162d217372ad |
hex | b1d3df01439 |
12220221101113 has 8 divisors (see below), whose sum is σ = 12480454760832. Its totient is φ = 11959996981296.
The previous prime is 12220221100973. The next prime is 12220221101203. The reversal of 12220221101113 is 31110112202221.
12220221101113 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 12220221101113 - 213 = 12220221092921 is a prime.
It is not an unprimeable number, because it can be changed into a prime (12220221101513) 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, 234531 + ... + 4949287.
It is an arithmetic number, because the mean of its divisors is an integer number (1560056845104).
Almost surely, 212220221101113 is an apocalyptic number.
It is an amenable number.
12220221101113 is a deficient number, since it is larger than the sum of its proper divisors (260233659719).
12220221101113 is an equidigital number, since it uses as much as digits as its factorization.
12220221101113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4769951.
The product of its (nonzero) digits is 96, while the sum is 19.
Adding to 12220221101113 its reverse (31110112202221), we get a palindrome (43330333303334).
The spelling of 12220221101113 in words is "twelve trillion, two hundred twenty billion, two hundred twenty-one million, one hundred one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •