Base | Representation |
---|---|
bin | 10011000101010110110… |
… | …100001000010101100001 |
3 | 11122101000012222100221221 |
4 | 103011112310020111201 |
5 | 132441242403001424 |
6 | 2442243030415041 |
7 | 163514151044116 |
oct | 23052664102541 |
9 | 4571005870857 |
10 | 1311421531489 |
11 | 4661972a1913 |
12 | 1921b4501481 |
13 | 968884618b4 |
14 | 4768a42690d |
15 | 241a69cc9e4 |
hex | 13156d08561 |
1311421531489 has 2 divisors, whose sum is σ = 1311421531490. Its totient is φ = 1311421531488.
The previous prime is 1311421531481. The next prime is 1311421531531. The reversal of 1311421531489 is 9841351241131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 695235780864 + 616185750625 = 833808^2 + 784975^2 .
It is a cyclic number.
It is not a de Polignac number, because 1311421531489 - 23 = 1311421531481 is a prime.
It is not a weakly prime, because it can be changed into another prime (1311421531481) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 655710765744 + 655710765745.
It is an arithmetic number, because the mean of its divisors is an integer number (655710765745).
Almost surely, 21311421531489 is an apocalyptic number.
It is an amenable number.
1311421531489 is a deficient number, since it is larger than the sum of its proper divisors (1).
1311421531489 is an equidigital number, since it uses as much as digits as its factorization.
1311421531489 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 103680, while the sum is 43.
The spelling of 1311421531489 in words is "one trillion, three hundred eleven billion, four hundred twenty-one million, five hundred thirty-one thousand, four hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •