Base | Representation |
---|---|
bin | 10011000101111111011… |
… | …100001001101010001111 |
3 | 11122102202201111012201001 |
4 | 103011333130021222033 |
5 | 132444141344030221 |
6 | 2442434415201131 |
7 | 163540065266236 |
oct | 23057734115217 |
9 | 4572681435631 |
10 | 1312103111311 |
11 | 466506aaa923 |
12 | 1923648161a7 |
13 | 96966721975 |
14 | 47712b67b1d |
15 | 241e6762391 |
hex | 1317f709a8f |
1312103111311 has 2 divisors, whose sum is σ = 1312103111312. Its totient is φ = 1312103111310.
The previous prime is 1312103111299. The next prime is 1312103111323. The reversal of 1312103111311 is 1131113012131.
It is a balanced prime because it is at equal distance from previous prime (1312103111299) and next prime (1312103111323).
It is a cyclic number.
It is not a de Polignac number, because 1312103111311 - 215 = 1312103078543 is a prime.
It is a super-2 number, since 2×13121031113112 (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 (1312103118311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 656051555655 + 656051555656.
It is an arithmetic number, because the mean of its divisors is an integer number (656051555656).
Almost surely, 21312103111311 is an apocalyptic number.
1312103111311 is a deficient number, since it is larger than the sum of its proper divisors (1).
1312103111311 is an equidigital number, since it uses as much as digits as its factorization.
1312103111311 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54, while the sum is 19.
Adding to 1312103111311 its reverse (1131113012131), we get a palindrome (2443216123442).
The spelling of 1312103111311 in words is "one trillion, three hundred twelve billion, one hundred three million, one hundred eleven thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •