Base | Representation |
---|---|
bin | 110101100101001100… |
… | …0101010000110111101 |
3 | 102000000001100212220221 |
4 | 1223022120222012331 |
5 | 3341123020030021 |
6 | 124505425541341 |
7 | 11212260025645 |
oct | 1531230520675 |
9 | 360001325827 |
10 | 115064611261 |
11 | 44886a78556 |
12 | 1a372aa4851 |
13 | ab0985b5c2 |
14 | 57d7aa3525 |
15 | 2ed6a63241 |
hex | 1aca62a1bd |
115064611261 has 2 divisors, whose sum is σ = 115064611262. Its totient is φ = 115064611260.
The previous prime is 115064611169. The next prime is 115064611267. The reversal of 115064611261 is 162116460511.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 112147963225 + 2916648036 = 334885^2 + 54006^2 .
It is a cyclic number.
It is not a de Polignac number, because 115064611261 - 27 = 115064611133 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (115064611267) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57532305630 + 57532305631.
It is an arithmetic number, because the mean of its divisors is an integer number (57532305631).
Almost surely, 2115064611261 is an apocalyptic number.
It is an amenable number.
115064611261 is a deficient number, since it is larger than the sum of its proper divisors (1).
115064611261 is an equidigital number, since it uses as much as digits as its factorization.
115064611261 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8640, while the sum is 34.
The spelling of 115064611261 in words is "one hundred fifteen billion, sixty-four million, six hundred eleven thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •