Base | Representation |
---|---|
bin | 1101101110100… |
… | …10011000100001 |
3 | 22000200120001001 |
4 | 12313102120201 |
5 | 213440002023 |
6 | 15232112001 |
7 | 2565546163 |
oct | 667223041 |
9 | 260616031 |
10 | 115156513 |
11 | 5a00387a |
12 | 32695601 |
13 | 1ab1c464 |
14 | 11418933 |
15 | a19a6ad |
hex | 6dd2621 |
115156513 has 2 divisors, whose sum is σ = 115156514. Its totient is φ = 115156512.
The previous prime is 115156501. The next prime is 115156523. The reversal of 115156513 is 315651511.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 97950609 + 17205904 = 9897^2 + 4148^2 .
It is a cyclic number.
It is not a de Polignac number, because 115156513 - 213 = 115148321 is a prime.
It is a super-2 number, since 2×1151565132 = 26522044972638338, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (115156523) 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, 57578256 + 57578257.
It is an arithmetic number, because the mean of its divisors is an integer number (57578257).
Almost surely, 2115156513 is an apocalyptic number.
It is an amenable number.
115156513 is a deficient number, since it is larger than the sum of its proper divisors (1).
115156513 is an equidigital number, since it uses as much as digits as its factorization.
115156513 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 115156513 is about 10731.1002697766. The cubic root of 115156513 is about 486.5149258480.
The spelling of 115156513 in words is "one hundred fifteen million, one hundred fifty-six thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •