Base | Representation |
---|---|
bin | 110010100000011101011110… |
… | …101100000110100000011001 |
3 | 1002010111201002212001021111212 |
4 | 302200131132230012200121 |
5 | 213103411342030413423 |
6 | 2104234254211232505 |
7 | 64534402605032663 |
oct | 6240353654064031 |
9 | 1063451085037455 |
10 | 222133002201113 |
11 | 64862093824443 |
12 | 20ab6a44ba8735 |
13 | 96c408a983b63 |
14 | 3cbd41a817533 |
15 | 1aa32c85e2578 |
hex | ca075eb06819 |
222133002201113 has 4 divisors (see below), whose sum is σ = 222220767119568. Its totient is φ = 222045237282660.
The previous prime is 222133002201109. The next prime is 222133002201163. The reversal of 222133002201113 is 311102200331222.
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 222133002201113 - 22 = 222133002201109 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (222133002201163) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 43882455431 + ... + 43882460492.
It is an arithmetic number, because the mean of its divisors is an integer number (55555191779892).
Almost surely, 2222133002201113 is an apocalyptic number.
It is an amenable number.
222133002201113 is a deficient number, since it is larger than the sum of its proper divisors (87764918455).
222133002201113 is an equidigital number, since it uses as much as digits as its factorization.
222133002201113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 87764918454.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 222133002201113 its reverse (311102200331222), we get a palindrome (533235202532335).
The spelling of 222133002201113 in words is "two hundred twenty-two trillion, one hundred thirty-three billion, two million, two hundred one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •