Base | Representation |
---|---|
bin | 10011000101000011110… |
… | …001001100101001001101 |
3 | 11122100011221201021010021 |
4 | 103011003301030221031 |
5 | 132440114102324342 |
6 | 2442151213542141 |
7 | 163503221040442 |
oct | 23050361145115 |
9 | 4570157637107 |
10 | 1311101995597 |
11 | 466042994869 |
12 | 1921254a4951 |
13 | 968371b39c4 |
14 | 47659c099c9 |
15 | 24188910567 |
hex | 13143c4ca4d |
1311101995597 has 2 divisors, whose sum is σ = 1311101995598. Its totient is φ = 1311101995596.
The previous prime is 1311101995507. The next prime is 1311101995603. The reversal of 1311101995597 is 7955991011131.
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., 1305475345476 + 5626650121 = 1142574^2 + 75011^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1311101995597 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1311101995507) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 655550997798 + 655550997799.
It is an arithmetic number, because the mean of its divisors is an integer number (655550997799).
Almost surely, 21311101995597 is an apocalyptic number.
It is an amenable number.
1311101995597 is a deficient number, since it is larger than the sum of its proper divisors (1).
1311101995597 is an equidigital number, since it uses as much as digits as its factorization.
1311101995597 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 382725, while the sum is 52.
The spelling of 1311101995597 in words is "one trillion, three hundred eleven billion, one hundred one million, nine hundred ninety-five thousand, five hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •