Base | Representation |
---|---|
bin | 100111011000010… |
… | …0001010000111101 |
3 | 10102002100010111002 |
4 | 1032300201100331 |
5 | 10201230421023 |
6 | 335040540045 |
7 | 44513136035 |
oct | 11660412075 |
9 | 3362303432 |
10 | 1321342013 |
11 | 6189548a2 |
12 | 30a621625 |
13 | 18099b1a4 |
14 | c76b88c5 |
15 | 7b008b28 |
hex | 4ec2143d |
1321342013 has 2 divisors, whose sum is σ = 1321342014. Its totient is φ = 1321342012.
The previous prime is 1321342007. The next prime is 1321342031. The reversal of 1321342013 is 3102431231.
Together with next prime (1321342031) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1298665369 + 22676644 = 36037^2 + 4762^2 .
It is an emirp because it is prime and its reverse (3102431231) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1321342013 - 24 = 1321341997 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1321342003) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 660671006 + 660671007.
It is an arithmetic number, because the mean of its divisors is an integer number (660671007).
Almost surely, 21321342013 is an apocalyptic number.
It is an amenable number.
1321342013 is a deficient number, since it is larger than the sum of its proper divisors (1).
1321342013 is an equidigital number, since it uses as much as digits as its factorization.
1321342013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 432, while the sum is 20.
The square root of 1321342013 is about 36350.2684034107. The cubic root of 1321342013 is about 1097.3329361747.
Adding to 1321342013 its reverse (3102431231), we get a palindrome (4423773244).
The spelling of 1321342013 in words is "one billion, three hundred twenty-one million, three hundred forty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •