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

bin | 100001000111000100100110… |

… | …101010000100101000111111 |

3 | 201002121021120201222110100220 |

4 | 201013010212222010220333 |

5 | 123041330330232443033 |

6 | 1233413333401152423 |

7 | 42446543613105540 |

oct | 4107044652045077 |

9 | 632537521873326 |

10 | 145621514734143 |

11 | 424438127a4518 |

12 | 143ba51278b713 |

13 | 633408588a686 |

14 | 27d619445a4c7 |

15 | 11c7e3a7a1bb3 |

hex | 847126a84a3f |

145621514734143 has 8 divisors (see below), whose sum is σ = 221899451023488. Its totient is φ = 83212294133784.

The previous prime is 145621514734141. The next prime is 145621514734193. The reversal of 145621514734143 is 341437415126541.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 145621514734143 - 2^{1} = 145621514734141 is a prime.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (145621514734141) by changing a digit.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3467178922221 + ... + 3467178922262.

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

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

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

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

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

The sum of its prime factors is 6934357844493.

The product of its digits is 4838400, while the sum is 51.

The spelling of 145621514734143 in words is "one hundred forty-five trillion, six hundred twenty-one billion, five hundred fourteen million, seven hundred thirty-four thousand, one hundred forty-three".

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