Base | Representation |
---|---|
bin | 10011010111111000100… |
… | …001011110110110010101 |
3 | 11201021100120221212102202 |
4 | 103113320201132312111 |
5 | 133303012442434031 |
6 | 2455333012214245 |
7 | 165120132603005 |
oct | 23277041366625 |
9 | 4637316855382 |
10 | 1331314421141 |
11 | 473675313291 |
12 | 19602660a385 |
13 | 987088a6513 |
14 | 486163ca005 |
15 | 2496d13c2cb |
hex | 135f885ed95 |
1331314421141 has 2 divisors, whose sum is σ = 1331314421142. Its totient is φ = 1331314421140.
The previous prime is 1331314421093. The next prime is 1331314421249. The reversal of 1331314421141 is 1411244131331.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1030385376241 + 300929044900 = 1015079^2 + 548570^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1331314421141 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1331314421741) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 665657210570 + 665657210571.
It is an arithmetic number, because the mean of its divisors is an integer number (665657210571).
Almost surely, 21331314421141 is an apocalyptic number.
It is an amenable number.
1331314421141 is a deficient number, since it is larger than the sum of its proper divisors (1).
1331314421141 is an equidigital number, since it uses as much as digits as its factorization.
1331314421141 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 3456, while the sum is 29.
Adding to 1331314421141 its reverse (1411244131331), we get a palindrome (2742558552472).
The spelling of 1331314421141 in words is "one trillion, three hundred thirty-one billion, three hundred fourteen million, four hundred twenty-one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •