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

bin | 101100010111011001101000… |

… | …000111011000010000101001 |

3 | 221120212111021101221120121011 |

4 | 230113121220013120100221 |

5 | 201033340040410201441 |

6 | 1530553505455543521 |

7 | 56046051544156243 |

oct | 5427315007302051 |

9 | 846774241846534 |

10 | 195122111022121 |

11 | 57198905938098 |

12 | 19a73b8022aba1 |

13 | 84b4c2285b9ba |

14 | 3627d63add093 |

15 | 1785891d16581 |

hex | b176681d8429 |

195122111022121 has 16 divisors (see below), whose sum is σ = 199068453876928. Its totient is φ = 191206262016000.

The previous prime is 195122111022119. The next prime is 195122111022227. The reversal of 195122111022121 is 121220111221591.

It is a happy number.

It is a cyclic number.

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

It is a Duffinian number.

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 336446446 + ... + 337025896.

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

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

It is an amenable number.

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

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

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

The sum of its prime factors is 605752.

The product of its (nonzero) digits is 1440, while the sum is 31.

The spelling of 195122111022121 in words is "one hundred ninety-five trillion, one hundred twenty-two billion, one hundred eleven million, twenty-two thousand, one hundred twenty-one".

Divisors: 1 67 193 12931 26041 579451 1744747 5025913 38823217 111834043 336736171 7492880881 15089483491 1010995393897 2912270313763 195122111022121

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