Base | Representation |
---|---|
bin | 10011100001000000100… |
… | …001000011101111010001 |
3 | 11202012122102012211010022 |
4 | 103201000201003233101 |
5 | 133433044211013431 |
6 | 2504033132513225 |
7 | 165615003435215 |
oct | 23410041035721 |
9 | 4665572184108 |
10 | 1341112204241 |
11 | 477842970797 |
12 | 197abb91b815 |
13 | 9960a711604 |
14 | 48ca5750945 |
15 | 24d433a407b |
hex | 13840843bd1 |
1341112204241 has 2 divisors, whose sum is σ = 1341112204242. Its totient is φ = 1341112204240.
The previous prime is 1341112204219. The next prime is 1341112204303. The reversal of 1341112204241 is 1424022111431.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1256183673616 + 84928530625 = 1120796^2 + 291425^2 .
It is a cyclic number.
It is not a de Polignac number, because 1341112204241 - 26 = 1341112204177 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1341112204241.
It is not a weakly prime, because it can be changed into another prime (1341112204741) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 670556102120 + 670556102121.
It is an arithmetic number, because the mean of its divisors is an integer number (670556102121).
Almost surely, 21341112204241 is an apocalyptic number.
It is an amenable number.
1341112204241 is a deficient number, since it is larger than the sum of its proper divisors (1).
1341112204241 is an equidigital number, since it uses as much as digits as its factorization.
1341112204241 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1536, while the sum is 26.
Adding to 1341112204241 its reverse (1424022111431), we get a palindrome (2765134315672).
The spelling of 1341112204241 in words is "one trillion, three hundred forty-one billion, one hundred twelve million, two hundred four thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •