Base | Representation |
---|---|
bin | 10011000110001011110… |
… | …101100110110110111101 |
3 | 11122110022012212200202222 |
4 | 103012023311212312331 |
5 | 133000103121023401 |
6 | 2442511205255125 |
7 | 163545202252514 |
oct | 23061365466675 |
9 | 4573265780688 |
10 | 1312311111101 |
11 | 466603457181 |
12 | 1924024044a5 |
13 | 9699a84a273 |
14 | 4773262d67b |
15 | 24209b4bc1b |
hex | 1318bd66dbd |
1312311111101 has 2 divisors, whose sum is σ = 1312311111102. Its totient is φ = 1312311111100.
The previous prime is 1312311111073. The next prime is 1312311111161. The reversal of 1312311111101 is 1011111132131.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 842037475876 + 470273635225 = 917626^2 + 685765^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1312311111101 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1312311111101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1312311111161) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 656155555550 + 656155555551.
It is an arithmetic number, because the mean of its divisors is an integer number (656155555551).
Almost surely, 21312311111101 is an apocalyptic number.
It is an amenable number.
1312311111101 is a deficient number, since it is larger than the sum of its proper divisors (1).
1312311111101 is an equidigital number, since it uses as much as digits as its factorization.
1312311111101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 18, while the sum is 17.
Adding to 1312311111101 its reverse (1011111132131), we get a palindrome (2323422243232).
The spelling of 1312311111101 in words is "one trillion, three hundred twelve billion, three hundred eleven million, one hundred eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.137 sec. • engine limits •