Base | Representation |
---|---|
bin | 100111000110110… |
… | …1100000100001101 |
3 | 10101110011020101022 |
4 | 1032031230010031 |
5 | 10141411224323 |
6 | 334113123525 |
7 | 44342416445 |
oct | 11615540415 |
9 | 3343136338 |
10 | 1312211213 |
11 | 613788785 |
12 | 3075595a5 |
13 | 17bb22151 |
14 | c63bd125 |
15 | 7a3034c8 |
hex | 4e36c10d |
1312211213 has 2 divisors, whose sum is σ = 1312211214. Its totient is φ = 1312211212.
The previous prime is 1312211209. The next prime is 1312211239. The reversal of 1312211213 is 3121122131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1019014084 + 293197129 = 31922^2 + 17123^2 .
It is an emirp because it is prime and its reverse (3121122131) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1312211213 - 22 = 1312211209 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1312211191 and 1312211200.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1312211293) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 656105606 + 656105607.
It is an arithmetic number, because the mean of its divisors is an integer number (656105607).
Almost surely, 21312211213 is an apocalyptic number.
It is an amenable number.
1312211213 is a deficient number, since it is larger than the sum of its proper divisors (1).
1312211213 is an equidigital number, since it uses as much as digits as its factorization.
1312211213 is an evil number, because the sum of its binary digits is even.
The product of its digits is 72, while the sum is 17.
The square root of 1312211213 is about 36224.4560069575. The cubic root of 1312211213 is about 1094.7994776091.
Adding to 1312211213 its reverse (3121122131), we get a palindrome (4433333344).
The spelling of 1312211213 in words is "one billion, three hundred twelve million, two hundred eleven thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •