Base | Representation |
---|---|
bin | 10011000101111111010… |
… | …100100100001111000101 |
3 | 11122102202120202012021101 |
4 | 103011333110210033011 |
5 | 132444140341414023 |
6 | 2442434304420101 |
7 | 163540042345402 |
oct | 23057724441705 |
9 | 4572676665241 |
10 | 1312101123013 |
11 | 466505971aaa |
12 | 192364017631 |
13 | 969661a6965 |
14 | 477127ab2a9 |
15 | 241e64bd1ad |
hex | 1317f5243c5 |
1312101123013 has 2 divisors, whose sum is σ = 1312101123014. Its totient is φ = 1312101123012.
The previous prime is 1312101122911. The next prime is 1312101123023. The reversal of 1312101123013 is 3103211012131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1274837453569 + 37263669444 = 1129087^2 + 193038^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1312101123013 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1312101123023) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 656050561506 + 656050561507.
It is an arithmetic number, because the mean of its divisors is an integer number (656050561507).
Almost surely, 21312101123013 is an apocalyptic number.
It is an amenable number.
1312101123013 is a deficient number, since it is larger than the sum of its proper divisors (1).
1312101123013 is an equidigital number, since it uses as much as digits as its factorization.
1312101123013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 1312101123013 its reverse (3103211012131), we get a palindrome (4415312135144).
The spelling of 1312101123013 in words is "one trillion, three hundred twelve billion, one hundred one million, one hundred twenty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •