Base | Representation |
---|---|
bin | 10111101100101000100000… |
… | …011010100100110011000001 |
3 | 111200000112202201121011120101 |
4 | 113230220200122210303001 |
5 | 102130034101340221423 |
6 | 1005355005455442401 |
7 | 30644543530063351 |
oct | 2754504032446301 |
9 | 450015681534511 |
10 | 104222220242113 |
11 | 302324392937a6 |
12 | b832b6a826401 |
13 | 46201619064ac |
14 | 1ba454d344b61 |
15 | c0b0d48347ad |
hex | 5eca206a4cc1 |
104222220242113 has 2 divisors, whose sum is σ = 104222220242114. Its totient is φ = 104222220242112.
The previous prime is 104222220242111. The next prime is 104222220242171. The reversal of 104222220242113 is 311242022222401.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 93860986723344 + 10361233518769 = 9688188^2 + 3218887^2 .
It is a cyclic number.
It is not a de Polignac number, because 104222220242113 - 21 = 104222220242111 is a prime.
Together with 104222220242111, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (104222220242111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52111110121056 + 52111110121057.
It is an arithmetic number, because the mean of its divisors is an integer number (52111110121057).
Almost surely, 2104222220242113 is an apocalyptic number.
It is an amenable number.
104222220242113 is a deficient number, since it is larger than the sum of its proper divisors (1).
104222220242113 is an equidigital number, since it uses as much as digits as its factorization.
104222220242113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6144, while the sum is 28.
Adding to 104222220242113 its reverse (311242022222401), we get a palindrome (415464242464514).
The spelling of 104222220242113 in words is "one hundred four trillion, two hundred twenty-two billion, two hundred twenty million, two hundred forty-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •