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

bin | 1010000111000000001100… |

… | …1010001011101011000101 |

3 | 1110100121212022111001202002 |

4 | 2201300003022023223011 |

5 | 2424103344130103244 |

6 | 35350205101555045 |

7 | 2225030451112661 |

oct | 241600312135305 |

9 | 43317768431662 |

10 | 11115428362949 |

11 | 35a6032594499 |

12 | 12b62b2575a85 |

13 | 628246441c31 |

14 | 2a5dbd6858a1 |

15 | 144210120a4e |

hex | a1c0328bac5 |

11115428362949 has 2 divisors, whose sum is σ = 11115428362950. Its totient is φ = 11115428362948.

The previous prime is 11115428362933. The next prime is 11115428362957. The reversal of 11115428362949 is 94926382451111.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 10673243262049 + 442185100900 = 3266993^2 + 664970^2 .

It is a cyclic number.

It is not a de Polignac number, because 11115428362949 - 2^{4} = 11115428362933 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

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

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (11115428362919) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5557714181474 + 5557714181475.

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

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

It is an amenable number.

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

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

11115428362949 is an evil number, because the sum of its binary digits is even.

The product of its digits is 3732480, while the sum is 56.

The spelling of 11115428362949 in words is "eleven trillion, one hundred fifteen billion, four hundred twenty-eight million, three hundred sixty-two thousand, nine hundred forty-nine".

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