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

bin | 1011111000000… |

… | …01011000001001 |

3 | 20221110020110000 |

4 | 11330001120021 |

5 | 201000322421 |

6 | 13515113213 |

7 | 2316521241 |

oct | 574013011 |

9 | 227406400 |

10 | 99620361 |

11 | 51262285 |

12 | 29442809 |

13 | 1783ca79 |

14 | d332b21 |

15 | 8b2c226 |

hex | 5f01609 |

99620361 has 15 divisors (see below), whose sum is σ = 148949911. Its totient is φ = 66353688.

The previous prime is 99620351. The next prime is 99620407. The reversal of 99620361 is 16302699.

Multipling 99620361 by its sum of digits (36), we get a square (3586332996 = 59886^{2}).

The square root of 99620361 is 9981.

It is a perfect power (a square), and thus also a powerful number.

It can be written as a sum of positive squares in only one way, i.e., 1610361 + 98010000 = 1269^2 + 9900^2 .

It is a de Polignac number, because none of the positive numbers 2^{k}-99620361 is a prime.

It is a Duffinian number.

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

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

It is a polite number, since it can be written in 14 ways as a sum of consecutive naturals, for example, 89275 + ... + 90383.

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

99620361 is the 9981-st square number.

99620361 is the 4991-st centered octagonal number.

It is an amenable number.

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

99620361 is an frugal number, since it uses more digits than its factorization.

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

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

The product of its (nonzero) digits is 17496, while the sum is 36.

The cubic root of 99620361 is about 463.5707624390.

The spelling of 99620361 in words is "ninety-nine million, six hundred twenty thousand, three hundred sixty-one".

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