Base | Representation |
---|---|
bin | 1101110010000… |
… | …01001000011101 |
3 | 22001112121022002 |
4 | 12321001020131 |
5 | 214044011031 |
6 | 15245532045 |
7 | 2602445543 |
oct | 671011035 |
9 | 261477262 |
10 | 115610141 |
11 | 5a293679 |
12 | 32874025 |
13 | 1ac4aa8a |
14 | 114d5d93 |
15 | a239ccb |
hex | 6e4121d |
115610141 has 4 divisors (see below), whose sum is σ = 115692252. Its totient is φ = 115528032.
The previous prime is 115610111. The next prime is 115610161. The reversal of 115610141 is 141016511.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 141016511 = 631 ⋅223481.
It can be written as a sum of positive squares in 2 ways, for example, as 54316900 + 61293241 = 7370^2 + 7829^2 .
It is a cyclic number.
It is not a de Polignac number, because 115610141 - 214 = 115593757 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (115610111) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 38906 + ... + 41771.
It is an arithmetic number, because the mean of its divisors is an integer number (28923063).
Almost surely, 2115610141 is an apocalyptic number.
It is an amenable number.
115610141 is a deficient number, since it is larger than the sum of its proper divisors (82111).
115610141 is an equidigital number, since it uses as much as digits as its factorization.
115610141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 82110.
The product of its (nonzero) digits is 120, while the sum is 20.
The square root of 115610141 is about 10752.2156321383. The cubic root of 115610141 is about 487.1529202545.
Adding to 115610141 its reverse (141016511), we get a palindrome (256626652).
The spelling of 115610141 in words is "one hundred fifteen million, six hundred ten thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •