Base | Representation |
---|---|

bin | 10011100010111111100… |

… | …110110111011011011101 |

3 | 11202102011000101021021011 |

4 | 103202333212313123131 |

5 | 134001431033324432 |

6 | 2505024501535221 |

7 | 166021564203016 |

oct | 23427746673335 |

9 | 4672130337234 |

10 | 1343244433117 |

11 | 478737511914 |

12 | 1983b5a14511 |

13 | 9988a3a4ac2 |

14 | 490289ca00d |

15 | 24e1a685847 |

hex | 138bf9b76dd |

1343244433117 has 2 divisors, whose sum is σ = 1343244433118. Its totient is φ = 1343244433116.

The previous prime is 1343244433109. The next prime is 1343244433121. The reversal of 1343244433117 is 7113344423431.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1343236958361 + 7474756 = 1158981^2 + 2734^2 .

It is a cyclic number.

It is not a de Polignac number, because 1343244433117 - 2^{3} = 1343244433109 is a prime.

It is a self number, because there is not a number *n* which added to its sum of digits gives 1343244433117.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (1343244433717) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 671622216558 + 671622216559.

It is an arithmetic number, because the mean of its divisors is an integer number (671622216559).

Almost surely, 2^{1343244433117} is an apocalyptic number.

It is an amenable number.

1343244433117 is a deficient number, since it is larger than the sum of its proper divisors (1).

1343244433117 is an equidigital number, since it uses as much as digits as its factorization.

1343244433117 is an odious number, because the sum of its binary digits is odd.

The product of its digits is 290304, while the sum is 40.

Adding to 1343244433117 its reverse (7113344423431), we get a palindrome (8456588856548).

The spelling of 1343244433117 in words is "one trillion, three hundred forty-three billion, two hundred forty-four million, four hundred thirty-three thousand, one hundred seventeen".

• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.107 sec. • engine limits •