Base | Representation |
---|---|
bin | 100100100001110110001010… |
… | …0100011011111101000111101 |
3 | 1120010200001020000201021121201 |
4 | 1021003230110203133220331 |
5 | 314103330210131330023 |
6 | 3055212145040055501 |
7 | 124451651443211416 |
oct | 11103542443375075 |
9 | 1503601200637551 |
10 | 321311143230013 |
11 | 9341a321875352 |
12 | 30054303904591 |
13 | 10a396842a8bc1 |
14 | 594b78415480d |
15 | 2723090a4cbad |
hex | 1243b148dfa3d |
321311143230013 has 2 divisors, whose sum is σ = 321311143230014. Its totient is φ = 321311143230012.
The previous prime is 321311143229983. The next prime is 321311143230029. The reversal of 321311143230013 is 310032341113123.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 267200804453284 + 54110338776729 = 16346278^2 + 7355973^2 .
It is a cyclic number.
It is not a de Polignac number, because 321311143230013 - 217 = 321311143098941 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (321311143230313) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 160655571615006 + 160655571615007.
It is an arithmetic number, because the mean of its divisors is an integer number (160655571615007).
Almost surely, 2321311143230013 is an apocalyptic number.
It is an amenable number.
321311143230013 is a deficient number, since it is larger than the sum of its proper divisors (1).
321311143230013 is an equidigital number, since it uses as much as digits as its factorization.
321311143230013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3888, while the sum is 28.
Adding to 321311143230013 its reverse (310032341113123), we get a palindrome (631343484343136).
The spelling of 321311143230013 in words is "three hundred twenty-one trillion, three hundred eleven billion, one hundred forty-three million, two hundred thirty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •