Base | Representation |
---|---|
bin | 10011000110000111001… |
… | …000001101110011001001 |
3 | 11122110002201012200012012 |
4 | 103012013020031303021 |
5 | 132444422404244423 |
6 | 2442455304025305 |
7 | 163543222560521 |
oct | 23060710156311 |
9 | 4573081180165 |
10 | 1312232103113 |
11 | 4665728a3318 |
12 | 19239ba62235 |
13 | 96987376589 |
14 | 47725d44681 |
15 | 24202c42078 |
hex | 1318720dcc9 |
1312232103113 has 4 divisors (see below), whose sum is σ = 1312391964180. Its totient is φ = 1312072242048.
The previous prime is 1312232103109. The next prime is 1312232103163. The reversal of 1312232103113 is 3113012322131.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 204966263824 + 1107265839289 = 452732^2 + 1052267^2 .
It is a cyclic number.
It is not a de Polignac number, because 1312232103113 - 22 = 1312232103109 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1312232103163) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 79918220 + ... + 79934637.
It is an arithmetic number, because the mean of its divisors is an integer number (328097991045).
Almost surely, 21312232103113 is an apocalyptic number.
It is an amenable number.
1312232103113 is a deficient number, since it is larger than the sum of its proper divisors (159861067).
1312232103113 is an equidigital number, since it uses as much as digits as its factorization.
1312232103113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 159861066.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 1312232103113 its reverse (3113012322131), we get a palindrome (4425244425244).
The spelling of 1312232103113 in words is "one trillion, three hundred twelve billion, two hundred thirty-two million, one hundred three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •