Base | Representation |
---|---|
bin | 1101101110011… |
… | …10011011011001 |
3 | 22000122201211001 |
4 | 12313032123121 |
5 | 213433442223 |
6 | 15231505001 |
7 | 2565451021 |
oct | 667163331 |
9 | 260581731 |
10 | 115140313 |
11 | 59aa2692 |
12 | 32688161 |
13 | 1ab14c82 |
14 | 11412a81 |
15 | a1959ad |
hex | 6dce6d9 |
115140313 has 4 divisors (see below), whose sum is σ = 115556260. Its totient is φ = 114724368.
The previous prime is 115140307. The next prime is 115140317. The reversal of 115140313 is 313041511.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 57562569 + 57577744 = 7587^2 + 7588^2 .
It is a cyclic number.
It is not a de Polignac number, because 115140313 - 25 = 115140281 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (115140317) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 207558 + ... + 208111.
It is an arithmetic number, because the mean of its divisors is an integer number (28889065).
Almost surely, 2115140313 is an apocalyptic number.
115140313 is the 7588-th centered square number.
It is an amenable number.
115140313 is a deficient number, since it is larger than the sum of its proper divisors (415947).
115140313 is an equidigital number, since it uses as much as digits as its factorization.
115140313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 415946.
The product of its (nonzero) digits is 180, while the sum is 19.
The square root of 115140313 is about 10730.3454278043. The cubic root of 115140313 is about 486.4921107788.
Adding to 115140313 its reverse (313041511), we get a palindrome (428181824).
The spelling of 115140313 in words is "one hundred fifteen million, one hundred forty thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •