Base | Representation |
---|---|
bin | 10011000101111011001… |
… | …101110000111001101001 |
3 | 11122102120210010010012222 |
4 | 103011323031300321221 |
5 | 132444020222343032 |
6 | 2442423404043425 |
7 | 163535244645164 |
oct | 23057315607151 |
9 | 4572523103188 |
10 | 1312032231017 |
11 | 46647aa98472 |
12 | 192344b33575 |
13 | 96954b35571 |
14 | 47707596adb |
15 | 241e0410a12 |
hex | 1317b370e69 |
1312032231017 has 2 divisors, whose sum is σ = 1312032231018. Its totient is φ = 1312032231016.
The previous prime is 1312032230983. The next prime is 1312032231019. The reversal of 1312032231017 is 7101322302131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1061963226256 + 250069004761 = 1030516^2 + 500069^2 .
It is a cyclic number.
It is not a de Polignac number, because 1312032231017 - 240 = 212520603241 is a prime.
It is a super-3 number, since 3×13120322310173 (a number of 37 digits) contains 333 as substring.
Together with 1312032231019, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (1312032231019) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 656016115508 + 656016115509.
It is an arithmetic number, because the mean of its divisors is an integer number (656016115509).
Almost surely, 21312032231017 is an apocalyptic number.
It is an amenable number.
1312032231017 is a deficient number, since it is larger than the sum of its proper divisors (1).
1312032231017 is an equidigital number, since it uses as much as digits as its factorization.
1312032231017 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1512, while the sum is 26.
Adding to 1312032231017 its reverse (7101322302131), we get a palindrome (8413354533148).
The spelling of 1312032231017 in words is "one trillion, three hundred twelve billion, thirty-two million, two hundred thirty-one thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •