Base | Representation |
---|---|
bin | 100111000110110… |
… | …1100100000010101 |
3 | 10101110011022211222 |
4 | 1032031230200111 |
5 | 10141411304023 |
6 | 334113140125 |
7 | 44342424626 |
oct | 11615544025 |
9 | 3343138758 |
10 | 1312213013 |
11 | 61378a071 |
12 | 30755a645 |
13 | 17bb22c07 |
14 | c63bda4d |
15 | 7a303cc8 |
hex | 4e36c815 |
1312213013 has 2 divisors, whose sum is σ = 1312213014. Its totient is φ = 1312213012.
The previous prime is 1312212977. The next prime is 1312213031. The reversal of 1312213013 is 3103122131.
Together with next prime (1312213031) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1249834609 + 62378404 = 35353^2 + 7898^2 .
It is a cyclic number.
It is not a de Polignac number, because 1312213013 - 212 = 1312208917 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1312212982 and 1312213000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1312213073) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 656106506 + 656106507.
It is an arithmetic number, because the mean of its divisors is an integer number (656106507).
Almost surely, 21312213013 is an apocalyptic number.
It is an amenable number.
1312213013 is a deficient number, since it is larger than the sum of its proper divisors (1).
1312213013 is an equidigital number, since it uses as much as digits as its factorization.
1312213013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 108, while the sum is 17.
The square root of 1312213013 is about 36224.4808520426. The cubic root of 1312213013 is about 1094.7999781988.
Adding to 1312213013 its reverse (3103122131), we get a palindrome (4415335144).
The spelling of 1312213013 in words is "one billion, three hundred twelve million, two hundred thirteen thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •