Base | Representation |
---|---|
bin | 1101110001101… |
… | …01010000101001 |
3 | 22001110010121001 |
4 | 12320311100221 |
5 | 214040432023 |
6 | 15244515001 |
7 | 2602154014 |
oct | 670652051 |
9 | 261403531 |
10 | 115561513 |
11 | 5a260091 |
12 | 3284ba61 |
13 | 1ac318c2 |
14 | 114c237b |
15 | a22a6ad |
hex | 6e35429 |
115561513 has 2 divisors, whose sum is σ = 115561514. Its totient is φ = 115561512.
The previous prime is 115561483. The next prime is 115561541. The reversal of 115561513 is 315165511.
It is an a-pointer prime, because the next prime (115561541) can be obtained adding 115561513 to its sum of digits (28).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 115498009 + 63504 = 10747^2 + 252^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-115561513 is a prime.
It is not a weakly prime, because it can be changed into another prime (115561543) 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, 57780756 + 57780757.
It is an arithmetic number, because the mean of its divisors is an integer number (57780757).
Almost surely, 2115561513 is an apocalyptic number.
It is an amenable number.
115561513 is a deficient number, since it is larger than the sum of its proper divisors (1).
115561513 is an equidigital number, since it uses as much as digits as its factorization.
115561513 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2250, while the sum is 28.
The square root of 115561513 is about 10749.9540929252. The cubic root of 115561513 is about 487.0846085009.
The spelling of 115561513 in words is "one hundred fifteen million, five hundred sixty-one thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •