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

bin | 111111101100011010111 |

3 | 10221001000000 |

4 | 13331203113 |

5 | 1013242002 |

6 | 112422343 |

7 | 23511630 |

oct | 7754327 |

9 | 3831000 |

10 | 2087127 |

11 | 11a60a9 |

12 | 8479b3 |

13 | 580cb3 |

14 | 3c4887 |

15 | 2b361c |

hex | 1fd8d7 |

2087127 has 28 divisors (see below), whose sum is σ = 3585040. Its totient is φ = 1189728.

The previous prime is 2087123. The next prime is 2087147. The reversal of 2087127 is 7217802.

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

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

It is a Harshad number since it is a multiple of its sum of digits (27).

It is a Duffinian number.

2087127 is a lucky number.

It is a self number, because there is not a number *n* which added to its sum of digits gives 2087127.

It is a congruent number.

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

It is a polite number, since it can be written in 27 ways as a sum of consecutive naturals, for example, 4899 + ... + 5307.

2^{2087127} is an apocalyptic number.

2087127 is a gapful number since it is divisible by the number (27) formed by its first and last digit.

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

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

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

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

The product of its (nonzero) digits is 1568, while the sum is 27.

The square root of 2087127 is about 1444.6892399405. The cubic root of 2087127 is about 127.7957149922.

The spelling of 2087127 in words is "two million, eighty-seven thousand, one hundred twenty-seven".

Divisors: 1 3 7 9 21 27 63 81 189 243 409 567 729 1227 1701 2863 3681 5103 8589 11043 25767 33129 77301 99387 231903 298161 695709 2087127

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