Base | Representation |
---|---|
bin | 10011100001010100110… |
… | …101101001111111101101 |
3 | 11202020112011202120020011 |
4 | 103201110311221333231 |
5 | 133434244001220031 |
6 | 2504131032253221 |
7 | 165626313423601 |
oct | 23412465517755 |
9 | 4666464676204 |
10 | 1341453148141 |
11 | 4779a836aa07 |
12 | 197b95b41211 |
13 | 99663246772 |
14 | 48cd8b41501 |
15 | 24d6329e6b1 |
hex | 13854d69fed |
1341453148141 has 2 divisors, whose sum is σ = 1341453148142. Its totient is φ = 1341453148140.
The previous prime is 1341453148127. The next prime is 1341453148151. The reversal of 1341453148141 is 1418413541431.
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., 1339412728900 + 2040419241 = 1157330^2 + 45171^2 .
It is a cyclic number.
It is not a de Polignac number, because 1341453148141 - 25 = 1341453148109 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1341453148094 and 1341453148103.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1341453148151) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 670726574070 + 670726574071.
It is an arithmetic number, because the mean of its divisors is an integer number (670726574071).
Almost surely, 21341453148141 is an apocalyptic number.
It is an amenable number.
1341453148141 is a deficient number, since it is larger than the sum of its proper divisors (1).
1341453148141 is an equidigital number, since it uses as much as digits as its factorization.
1341453148141 is an evil number, because the sum of its binary digits is even.
The product of its digits is 92160, while the sum is 40.
Adding to 1341453148141 its reverse (1418413541431), we get a palindrome (2759866689572).
The spelling of 1341453148141 in words is "one trillion, three hundred forty-one billion, four hundred fifty-three million, one hundred forty-eight thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •