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

bin | 1101010001111… |

… | …10001111110101 |

3 | 21202121220120212 |

4 | 12220332033311 |

5 | 212004412041 |

6 | 15015435205 |

7 | 2521630031 |

oct | 650761765 |

9 | 252556525 |

10 | 111404021 |

11 | 57980543 |

12 | 31385b05 |

13 | 1a107451 |

14 | 10b1d1c1 |

15 | 9ba88eb |

hex | 6a3e3f5 |

111404021 has 2 divisors, whose sum is σ = 111404022. Its totient is φ = 111404020.

The previous prime is 111403979. The next prime is 111404047. The reversal of 111404021 is 120404111.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 63600625 + 47803396 = 7975^2 + 6914^2 .

It is a cyclic number.

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

It is a Chen prime.

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

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (111404071) 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 as a sum of consecutive naturals, namely, 55702010 + 55702011.

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

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

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 32, while the sum is 14.

The square root of 111404021 is about 10554.8103251551. The cubic root of 111404021 is about 481.1719352546.

Adding to 111404021 its reverse (120404111), we get a palindrome (231808132).

The spelling of 111404021 in words is "one hundred eleven million, four hundred four thousand, twenty-one".

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