Base | Representation |
---|---|
bin | 11001100000110111101101… |
… | …001100111100000101101001 |
3 | 112201022011121211211010002212 |
4 | 121200313231030330011221 |
5 | 104201422040022400131 |
6 | 1034352321253534505 |
7 | 32430622260336032 |
oct | 3140675514740551 |
9 | 481264554733085 |
10 | 112210000200041 |
11 | 32831aa2893507 |
12 | 10703072044435 |
13 | 4a7c4858b2213 |
14 | 1d9cdc8a87a89 |
15 | ce8c8da61a2b |
hex | 660ded33c169 |
112210000200041 has 2 divisors, whose sum is σ = 112210000200042. Its totient is φ = 112210000200040.
The previous prime is 112210000199897. The next prime is 112210000200097. The reversal of 112210000200041 is 140002000012211.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 112189616641600 + 20383558441 = 10591960^2 + 142771^2 .
It is a cyclic number.
It is not a de Polignac number, because 112210000200041 - 230 = 112208926458217 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 112210000199989 and 112210000200025.
It is not a weakly prime, because it can be changed into another prime (112210000100041) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56105000100020 + 56105000100021.
It is an arithmetic number, because the mean of its divisors is an integer number (56105000100021).
Almost surely, 2112210000200041 is an apocalyptic number.
It is an amenable number.
112210000200041 is a deficient number, since it is larger than the sum of its proper divisors (1).
112210000200041 is an equidigital number, since it uses as much as digits as its factorization.
112210000200041 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 112210000200041 its reverse (140002000012211), we get a palindrome (252212000212252).
The spelling of 112210000200041 in words is "one hundred twelve trillion, two hundred ten billion, two hundred thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •