Base | Representation |
---|---|
bin | 10011000101100011010… |
… | …000111001101010001101 |
3 | 11122101112202222222212221 |
4 | 103011203100321222031 |
5 | 132442204340301031 |
6 | 2442315451255341 |
7 | 163522265306455 |
oct | 23054320715215 |
9 | 4571482888787 |
10 | 1311630400141 |
11 | 466294191a36 |
12 | 19225244a551 |
13 | 968bc802809 |
14 | 476aa076d65 |
15 | 241b9ed9a11 |
hex | 13163439a8d |
1311630400141 has 2 divisors, whose sum is σ = 1311630400142. Its totient is φ = 1311630400140.
The previous prime is 1311630400117. The next prime is 1311630400151. The reversal of 1311630400141 is 1410040361131.
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., 838224478116 + 473405922025 = 915546^2 + 688045^2 .
It is a cyclic number.
It is not a de Polignac number, because 1311630400141 - 27 = 1311630400013 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1311630400151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 655815200070 + 655815200071.
It is an arithmetic number, because the mean of its divisors is an integer number (655815200071).
Almost surely, 21311630400141 is an apocalyptic number.
It is an amenable number.
1311630400141 is a deficient number, since it is larger than the sum of its proper divisors (1).
1311630400141 is an equidigital number, since it uses as much as digits as its factorization.
1311630400141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 25.
Adding to 1311630400141 its reverse (1410040361131), we get a palindrome (2721670761272).
The spelling of 1311630400141 in words is "one trillion, three hundred eleven billion, six hundred thirty million, four hundred thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •