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

bin | 10111110101110… |

… | …11111001010101 |

3 | 111221100000010122 |

4 | 23322323321111 |

5 | 402144432221 |

6 | 31502401325 |

7 | 4645651433 |

oct | 1372737125 |

9 | 457300118 |

10 | 199999061 |

11 | a2992289 |

12 | 56b90245 |

13 | 32586a52 |

14 | 1c7c1d53 |

15 | 12858eab |

hex | bebbe55 |

199999061 has 2 divisors, whose sum is σ = 199999062. Its totient is φ = 199999060.

The previous prime is 199999057. The next prime is 199999081. The reversal of 199999061 is 160999991.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 191296561 + 8702500 = 13831^2 + 2950^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 199999061 - 2^{2} = 199999057 is a prime.

It is a junction number, because it is equal to *n*+sod(*n*) for *n* = 199998994 and 199999012.

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

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

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

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

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 354294, while the sum is 53.

The square root of 199999061 is about 14142.1024250286. The cubic root of 199999061 is about 584.8026324236.

The spelling of 199999061 in words is "one hundred ninety-nine million, nine hundred ninety-nine thousand, sixty-one".

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