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

bin | 1100110101010011110110… |

… | …0110101111101011011001 |

3 | 1211221220101020110120002121 |

4 | 3031110331212233223121 |

5 | 3322134240242244142 |

6 | 50002013421101241 |

7 | 2654261660514025 |

oct | 315247546575331 |

9 | 54856336416077 |

10 | 14110001134297 |

11 | 455002187aa32 |

12 | 16ba7429b7821 |

13 | 7b474b75a223 |

14 | 36acdb869385 |

15 | 19707816bc67 |

hex | cd53d9afad9 |

14110001134297 has 2 divisors, whose sum is σ = 14110001134298. Its totient is φ = 14110001134296.

The previous prime is 14110001134237. The next prime is 14110001134321. The reversal of 14110001134297 is 79243110001141.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 14070931263376 + 39069870921 = 3751124^2 + 197661^2 .

It is an emirp because it is prime and its reverse (79243110001141) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 14110001134297 - 2^{27} = 14109866916569 is a prime.

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

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

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

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

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 6048, while the sum is 34.

The spelling of 14110001134297 in words is "fourteen trillion, one hundred ten billion, one million, one hundred thirty-four thousand, two hundred ninety-seven".

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