Base | Representation |
---|---|
bin | 101000000010011… |
… | …0111010000001001 |
3 | 10110121221102220202 |
4 | 1100010313100021 |
5 | 10222410432134 |
6 | 341150501545 |
7 | 45202104113 |
oct | 12004672011 |
9 | 3417842822 |
10 | 1343452169 |
11 | 62a386554 |
12 | 315b048b5 |
13 | 18543cc17 |
14 | ca5d23b3 |
15 | 7ce24d7e |
hex | 50137409 |
1343452169 has 2 divisors, whose sum is σ = 1343452170. Its totient is φ = 1343452168.
The previous prime is 1343452091. The next prime is 1343452189. The reversal of 1343452169 is 9612543431.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1304076544 + 39375625 = 36112^2 + 6275^2 .
It is an emirp because it is prime and its reverse (9612543431) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1343452169 - 28 = 1343451913 is a prime.
It is a super-2 number, since 2×13434521692 = 3609727460781609122, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1343452189) 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, 671726084 + 671726085.
It is an arithmetic number, because the mean of its divisors is an integer number (671726085).
Almost surely, 21343452169 is an apocalyptic number.
It is an amenable number.
1343452169 is a deficient number, since it is larger than the sum of its proper divisors (1).
1343452169 is an equidigital number, since it uses as much as digits as its factorization.
1343452169 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 77760, while the sum is 38.
The square root of 1343452169 is about 36653.1331402924. The cubic root of 1343452169 is about 1103.4197072989.
The spelling of 1343452169 in words is "one billion, three hundred forty-three million, four hundred fifty-two thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •