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

bin | 10011000100110000010011 |

3 | 100102001000000 |

4 | 103010300103 |

5 | 2240001321 |

6 | 255101043 |

7 | 60333606 |

oct | 23046023 |

9 | 10361000 |

10 | 5000211 |

11 | 2905807 |

12 | 1811783 |

13 | 1060c08 |

14 | 94233d |

15 | 68b826 |

hex | 4c4c13 |

5000211 has 28 divisors (see below), whose sum is σ = 7913320. Its totient is φ = 3158028.

The previous prime is 5000201. The next prime is 5000213. The reversal of 5000211 is 1120005.

Adding to 5000211 its reverse (1120005), we get a palindrome (6120216).

It is a happy number.

The cubic root of 5000211 is 171.

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

It is not a de Polignac number, because 5000211 - 2^{10} = 4999187 is a prime.

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

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

It is a Duffinian number.

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

It is not an unprimeable number, because it can be changed into a prime (5000213) 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, 263160 + ... + 263178.

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

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

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

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

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

The product of its (nonzero) digits is 10, while the sum is 9.

The square root of 5000211 is about 2236.1151580364.

The spelling of 5000211 in words is "five million, two hundred eleven", and thus it is an aban number.

Divisors: 1 3 9 19 27 57 81 171 243 361 513 729 1083 1539 3249 4617 6859 9747 13851 20577 29241 61731 87723 185193 263169 555579 1666737 5000211

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