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

bin | 1101111011101… |

… | …11011110100011 |

3 | 22010221012000121 |

4 | 12331313132203 |

5 | 214410200230 |

6 | 15333101111 |

7 | 2616321565 |

oct | 675673643 |

9 | 263835017 |

10 | 116881315 |

11 | 5aa81731 |

12 | 33187797 |

13 | 1b2a4555 |

14 | 11747335 |

15 | a3db77a |

hex | 6f777a3 |

116881315 has 8 divisors (see below), whose sum is σ = 144782208. Its totient is φ = 90488640.

The previous prime is 116881313. The next prime is 116881321. The reversal of 116881315 is 513188611.

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

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

It is a super-2 number, since 2×116881315^{2} = 27322483592258450, which contains 22 as substring.

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (116881313) 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 in 7 ways as a sum of consecutive naturals, for example, 376882 + ... + 377191.

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

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

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

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

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

The sum of its prime factors is 754109.

The product of its digits is 5760, while the sum is 34.

The square root of 116881315 is about 10811.1662183134. The cubic root of 116881315 is about 488.9318883112.

The spelling of 116881315 in words is "one hundred sixteen million, eight hundred eighty-one thousand, three hundred fifteen".

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