Base | Representation |
---|---|
bin | 1101101110011… |
… | …10011110101001 |
3 | 22000122202002202 |
4 | 12313032132221 |
5 | 213433444041 |
6 | 15231505545 |
7 | 2565451436 |
oct | 667163651 |
9 | 260582082 |
10 | 115140521 |
11 | 59aa2861 |
12 | 326882b5 |
13 | 1ab150b2 |
14 | 11412b8d |
15 | a195a9b |
hex | 6dce7a9 |
115140521 has 4 divisors (see below), whose sum is σ = 115275732. Its totient is φ = 115005312.
The previous prime is 115140517. The next prime is 115140523. The reversal of 115140521 is 125041511.
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 54922921 + 60217600 = 7411^2 + 7760^2 .
It is a cyclic number.
It is not a de Polignac number, because 115140521 - 22 = 115140517 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 115140493 and 115140502.
It is not an unprimeable number, because it can be changed into a prime (115140523) 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, 66320 + ... + 68033.
It is an arithmetic number, because the mean of its divisors is an integer number (28818933).
Almost surely, 2115140521 is an apocalyptic number.
It is an amenable number.
115140521 is a deficient number, since it is larger than the sum of its proper divisors (135211).
115140521 is an equidigital number, since it uses as much as digits as its factorization.
115140521 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 135210.
The product of its (nonzero) digits is 200, while the sum is 20.
The square root of 115140521 is about 10730.3551199389. The cubic root of 115140521 is about 486.4924037266.
The spelling of 115140521 in words is "one hundred fifteen million, one hundred forty thousand, five hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •