Base | Representation |
---|---|
bin | 101000000010001… |
… | …0100110110011101 |
3 | 10110121200021121221 |
4 | 1100010110312131 |
5 | 10222341430021 |
6 | 341143453341 |
7 | 45200646235 |
oct | 12004246635 |
9 | 3417607557 |
10 | 1343311261 |
11 | 62a29a6a6 |
12 | 315a57251 |
13 | 1853c0a46 |
14 | ca596cc5 |
15 | 7cde8241 |
hex | 50114d9d |
1343311261 has 2 divisors, whose sum is σ = 1343311262. Its totient is φ = 1343311260.
The previous prime is 1343311247. The next prime is 1343311273. The reversal of 1343311261 is 1621133431.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1215847161 + 127464100 = 34869^2 + 11290^2 .
It is an emirp because it is prime and its reverse (1621133431) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1343311261 - 215 = 1343278493 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1343311241) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 671655630 + 671655631.
It is an arithmetic number, because the mean of its divisors is an integer number (671655631).
Almost surely, 21343311261 is an apocalyptic number.
It is an amenable number.
1343311261 is a deficient number, since it is larger than the sum of its proper divisors (1).
1343311261 is an equidigital number, since it uses as much as digits as its factorization.
1343311261 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1296, while the sum is 25.
The square root of 1343311261 is about 36651.2109076903. The cubic root of 1343311261 is about 1103.3811285529.
Adding to 1343311261 its reverse (1621133431), we get a palindrome (2964444692).
The spelling of 1343311261 in words is "one billion, three hundred forty-three million, three hundred eleven thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •