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

bin | 1101111101110… |

… | …01011110010001 |

3 | 22011102220211101 |

4 | 12332321132101 |

5 | 214442323013 |

6 | 15342544401 |

7 | 2621525644 |

oct | 676713621 |

9 | 264386741 |

10 | 117151633 |

11 | 60146835 |

12 | 33298101 |

13 | 1b36a5c1 |

14 | 117b7a5b |

15 | a4418dd |

hex | 6fb9791 |

117151633 has 4 divisors (see below), whose sum is σ = 118801728. Its totient is φ = 115501540.

The previous prime is 117151613. The next prime is 117151649. The reversal of 117151633 is 336151711.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

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

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

It is a Duffinian number.

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

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 824941 + ... + 825082.

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

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

It is an amenable number.

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

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

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

The sum of its prime factors is 1650094.

The product of its digits is 1890, while the sum is 28.

The square root of 117151633 is about 10823.6607947589. The cubic root of 117151633 is about 489.3085248757.

The spelling of 117151633 in words is "one hundred seventeen million, one hundred fifty-one thousand, six hundred thirty-three".

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