Base | Representation |
---|---|
bin | 101000000001110… |
… | …0011110011111001 |
3 | 10110121022002002101 |
4 | 1100003203303321 |
5 | 10222314013033 |
6 | 341135303401 |
7 | 45166151512 |
oct | 12003436371 |
9 | 3417262071 |
10 | 1343110393 |
11 | 62a172799 |
12 | 31597ab61 |
13 | 1853504a1 |
14 | ca543a09 |
15 | 7cda897d |
hex | 500e3cf9 |
1343110393 has 2 divisors, whose sum is σ = 1343110394. Its totient is φ = 1343110392.
The previous prime is 1343110339. The next prime is 1343110409. The reversal of 1343110393 is 3930113431.
Together with previous prime (1343110339) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1258617529 + 84492864 = 35477^2 + 9192^2 .
It is a cyclic number.
It is not a de Polignac number, because 1343110393 - 229 = 806239481 is a prime.
It is a super-2 number, since 2×13431103932 = 3607891055569228898, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1343110193) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 671555196 + 671555197.
It is an arithmetic number, because the mean of its divisors is an integer number (671555197).
Almost surely, 21343110393 is an apocalyptic number.
It is an amenable number.
1343110393 is a deficient number, since it is larger than the sum of its proper divisors (1).
1343110393 is an equidigital number, since it uses as much as digits as its factorization.
1343110393 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2916, while the sum is 28.
The square root of 1343110393 is about 36648.4705410744. The cubic root of 1343110393 is about 1103.3261288877.
The spelling of 1343110393 in words is "one billion, three hundred forty-three million, one hundred ten thousand, three hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •