Base | Representation |
---|---|
bin | 110101101000001100… |
… | …0000010000110000101 |
3 | 102000021001110210011221 |
4 | 1223100120002012011 |
5 | 3341324232020121 |
6 | 124523420000341 |
7 | 11214620201056 |
oct | 1532030020605 |
9 | 360231423157 |
10 | 115165110661 |
11 | 44928780207 |
12 | 1a3a06900b1 |
13 | ab246184c3 |
14 | 580718472d |
15 | 2ee07b5b41 |
hex | 1ad0602185 |
115165110661 has 2 divisors, whose sum is σ = 115165110662. Its totient is φ = 115165110660.
The previous prime is 115165110611. The next prime is 115165110673. The reversal of 115165110661 is 166011561511.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 107616802500 + 7548308161 = 328050^2 + 86881^2 .
It is an emirp because it is prime and its reverse (166011561511) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 115165110661 - 211 = 115165108613 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (115165110611) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57582555330 + 57582555331.
It is an arithmetic number, because the mean of its divisors is an integer number (57582555331).
Almost surely, 2115165110661 is an apocalyptic number.
It is an amenable number.
115165110661 is a deficient number, since it is larger than the sum of its proper divisors (1).
115165110661 is an equidigital number, since it uses as much as digits as its factorization.
115165110661 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5400, while the sum is 34.
The spelling of 115165110661 in words is "one hundred fifteen billion, one hundred sixty-five million, one hundred ten thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •