Base | Representation |
---|---|
bin | 10011000100111110111… |
… | …110010001001110001001 |
3 | 11122022222100022111111021 |
4 | 103010332332101032021 |
5 | 132434433003124022 |
6 | 2442135221232441 |
7 | 163501223121655 |
oct | 23047676211611 |
9 | 4568870274437 |
10 | 1311021536137 |
11 | 46600152a445 |
12 | 192102562721 |
13 | 96823622461 |
14 | 4764d263a65 |
15 | 2418181a7c7 |
hex | 1313ef91389 |
1311021536137 has 2 divisors, whose sum is σ = 1311021536138. Its totient is φ = 1311021536136.
The previous prime is 1311021536089. The next prime is 1311021536141. The reversal of 1311021536137 is 7316351201131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 759026030841 + 551995505296 = 871221^2 + 742964^2 .
It is a cyclic number.
It is not a de Polignac number, because 1311021536137 - 211 = 1311021534089 is a prime.
It is not a weakly prime, because it can be changed into another prime (1311021536437) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 655510768068 + 655510768069.
It is an arithmetic number, because the mean of its divisors is an integer number (655510768069).
Almost surely, 21311021536137 is an apocalyptic number.
It is an amenable number.
1311021536137 is a deficient number, since it is larger than the sum of its proper divisors (1).
1311021536137 is an equidigital number, since it uses as much as digits as its factorization.
1311021536137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11340, while the sum is 34.
Adding to 1311021536137 its reverse (7316351201131), we get a palindrome (8627372737268).
The spelling of 1311021536137 in words is "one trillion, three hundred eleven billion, twenty-one million, five hundred thirty-six thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •