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

bin | 111111100101111011… |

… | …1111100010110011101 |

3 | 111001111102001122101221 |

4 | 1333023313330112131 |

5 | 4214140443114031 |

6 | 142423053333341 |

7 | 12603123316663 |

oct | 1771367742635 |

9 | 431442048357 |

10 | 136564426141 |

11 | 52a0a070700 |

12 | 22573197251 |

13 | cb54b92160 |

14 | 6877240c33 |

15 | 38442dda11 |

hex | 1fcbdfc59d |

136564426141 has 24 divisors (see below), whose sum is σ = 165414270560. Its totient is φ = 111934357920.

The previous prime is 136564426121. The next prime is 136564426189. The reversal of 136564426141 is 141624465631.

It is not a de Polignac number, because 136564426141 - 2^{7} = 136564426013 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (43).

It is a congruent number.

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

It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 941871 + ... + 1077148.

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

136564426141 is a gapful number since it is divisible by the number (11) formed by its first and last digit.

It is an amenable number.

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

136564426141 is a wasteful number, since it uses less digits than its factorization.

136564426141 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 2019097 (or 2019086 counting only the distinct ones).

The product of its digits is 414720, while the sum is 43.

The spelling of 136564426141 in words is "one hundred thirty-six billion, five hundred sixty-four million, four hundred twenty-six thousand, one hundred forty-one".

Divisors: 1 11 13 43 121 143 473 559 1573 5203 6149 67639 2019019 22209209 26247247 86817817 244301299 288719717 954995987 1128631621 3175916887 10504955857 12414947831 136564426141

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