Base | Representation |
---|---|
bin | 1101101110100… |
… | …00111010110001 |
3 | 22000200020210211 |
4 | 12313100322301 |
5 | 213434304023 |
6 | 15232024121 |
7 | 2565522532 |
oct | 667207261 |
9 | 260606724 |
10 | 115150513 |
11 | 59aaa315 |
12 | 32692041 |
13 | 1ab197ca |
14 | 11416689 |
15 | a198a0d |
hex | 6dd0eb1 |
115150513 has 2 divisors, whose sum is σ = 115150514. Its totient is φ = 115150512.
The previous prime is 115150499. The next prime is 115150531. The reversal of 115150513 is 315051511.
Together with next prime (115150531) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 64128064 + 51022449 = 8008^2 + 7143^2 .
It is a cyclic number.
It is not a de Polignac number, because 115150513 - 221 = 113053361 is a prime.
It is not a weakly prime, because it can be changed into another prime (115150913) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57575256 + 57575257.
It is an arithmetic number, because the mean of its divisors is an integer number (57575257).
Almost surely, 2115150513 is an apocalyptic number.
It is an amenable number.
115150513 is a deficient number, since it is larger than the sum of its proper divisors (1).
115150513 is an equidigital number, since it uses as much as digits as its factorization.
115150513 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 375, while the sum is 22.
The square root of 115150513 is about 10730.8207048669. The cubic root of 115150513 is about 486.5064760719.
The spelling of 115150513 in words is "one hundred fifteen million, one hundred fifty thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •