Base | Representation |
---|---|
bin | 101000000010001… |
… | …0100110100100101 |
3 | 10110121200021110111 |
4 | 1100010110310211 |
5 | 10222341424031 |
6 | 341143453021 |
7 | 45200646004 |
oct | 12004246445 |
9 | 3417607414 |
10 | 1343311141 |
11 | 62a29a5a7 |
12 | 315a57171 |
13 | 1853c0983 |
14 | ca596c3b |
15 | 7cde81b1 |
hex | 50114d25 |
1343311141 has 2 divisors, whose sum is σ = 1343311142. Its totient is φ = 1343311140.
The previous prime is 1343311097. The next prime is 1343311147. The reversal of 1343311141 is 1411133431.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 919363041 + 423948100 = 30321^2 + 20590^2 .
It is a cyclic number.
It is not a de Polignac number, because 1343311141 - 213 = 1343302949 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1343311147) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 671655570 + 671655571.
It is an arithmetic number, because the mean of its divisors is an integer number (671655571).
Almost surely, 21343311141 is an apocalyptic number.
It is an amenable number.
1343311141 is a deficient number, since it is larger than the sum of its proper divisors (1).
1343311141 is an equidigital number, since it uses as much as digits as its factorization.
1343311141 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 432, while the sum is 22.
The square root of 1343311141 is about 36651.2092706366. The cubic root of 1343311141 is about 1103.3810956973.
Adding to 1343311141 its reverse (1411133431), we get a palindrome (2754444572).
The spelling of 1343311141 in words is "one billion, three hundred forty-three million, three hundred eleven thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.115 sec. • engine limits •