Base | Representation |
---|---|
bin | 10011000101000011101… |
… | …101011011110010101101 |
3 | 11122100011212212010212012 |
4 | 103011003231123302231 |
5 | 132440113324242234 |
6 | 2442151140451005 |
7 | 163503206461325 |
oct | 23050355336255 |
9 | 4570155763765 |
10 | 1311101009069 |
11 | 466042380655 |
12 | 1921250a9a65 |
13 | 96836c29967 |
14 | 47659a30285 |
15 | 241887b80ce |
hex | 13143b5bcad |
1311101009069 has 2 divisors, whose sum is σ = 1311101009070. Its totient is φ = 1311101009068.
The previous prime is 1311101009033. The next prime is 1311101009083. The reversal of 1311101009069 is 9609001011131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 659790675625 + 651310333444 = 812275^2 + 807038^2 .
It is a cyclic number.
It is not a de Polignac number, because 1311101009069 - 240 = 211589381293 is a prime.
It is a super-2 number, since 2×13111010090692 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1311101009089) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 655550504534 + 655550504535.
It is an arithmetic number, because the mean of its divisors is an integer number (655550504535).
Almost surely, 21311101009069 is an apocalyptic number.
It is an amenable number.
1311101009069 is a deficient number, since it is larger than the sum of its proper divisors (1).
1311101009069 is an equidigital number, since it uses as much as digits as its factorization.
1311101009069 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1458, while the sum is 32.
The spelling of 1311101009069 in words is "one trillion, three hundred eleven billion, one hundred one million, nine thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •