Base | Representation |
---|---|
bin | 101000000001110… |
… | …0100011111000001 |
3 | 10110121022012212121 |
4 | 1100003210133001 |
5 | 10222314110103 |
6 | 341135324241 |
7 | 45166162534 |
oct | 12003443701 |
9 | 3417265777 |
10 | 1343113153 |
11 | 62a174878 |
12 | 315980681 |
13 | 185351815 |
14 | ca544a1b |
15 | 7cda96bd |
hex | 500e47c1 |
1343113153 has 2 divisors, whose sum is σ = 1343113154. Its totient is φ = 1343113152.
The previous prime is 1343113147. The next prime is 1343113159. The reversal of 1343113153 is 3513113431.
It is a balanced prime because it is at equal distance from previous prime (1343113147) and next prime (1343113159).
It can be written as a sum of positive squares in only one way, i.e., 1343075904 + 37249 = 36648^2 + 193^2 .
It is an emirp because it is prime and its reverse (3513113431) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1343113153 is a prime.
It is not a weakly prime, because it can be changed into another prime (1343113159) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 671556576 + 671556577.
It is an arithmetic number, because the mean of its divisors is an integer number (671556577).
Almost surely, 21343113153 is an apocalyptic number.
It is an amenable number.
1343113153 is a deficient number, since it is larger than the sum of its proper divisors (1).
1343113153 is an equidigital number, since it uses as much as digits as its factorization.
1343113153 is an evil number, because the sum of its binary digits is even.
The product of its digits is 1620, while the sum is 25.
The square root of 1343113153 is about 36648.5081961053. The cubic root of 1343113153 is about 1103.3268846405.
Adding to 1343113153 its reverse (3513113431), we get a palindrome (4856226584).
The spelling of 1343113153 in words is "one billion, three hundred forty-three million, one hundred thirteen thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •