Base | Representation |
---|---|
bin | 11010001011101110111011… |
… | …011101011000011001001101 |
3 | 120002201202111201012201221222 |
4 | 122023232323131120121031 |
5 | 110043201442340331131 |
6 | 1044525413520133125 |
7 | 33153465653013032 |
oct | 3213567335303115 |
9 | 502652451181858 |
10 | 115155513214541 |
11 | 337681a7125558 |
12 | 10ab9ab04671a5 |
13 | 4c3416cba45a7 |
14 | 20617b1371389 |
15 | d4a6d4a4387b |
hex | 68bbbb75864d |
115155513214541 has 2 divisors, whose sum is σ = 115155513214542. Its totient is φ = 115155513214540.
The previous prime is 115155513214531. The next prime is 115155513214549. The reversal of 115155513214541 is 145412315551511.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 115138350904516 + 17162310025 = 10730254^2 + 131005^2 .
It is a cyclic number.
It is not a de Polignac number, because 115155513214541 - 218 = 115155512952397 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 115155513214492 and 115155513214501.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (115155513214549) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57577756607270 + 57577756607271.
It is an arithmetic number, because the mean of its divisors is an integer number (57577756607271).
Almost surely, 2115155513214541 is an apocalyptic number.
It is an amenable number.
115155513214541 is a deficient number, since it is larger than the sum of its proper divisors (1).
115155513214541 is an equidigital number, since it uses as much as digits as its factorization.
115155513214541 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 300000, while the sum is 44.
The spelling of 115155513214541 in words is "one hundred fifteen trillion, one hundred fifty-five billion, five hundred thirteen million, two hundred fourteen thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •