Base | Representation |
---|---|
bin | 1101111001010… |
… | …10011010011101 |
3 | 22010100011000201 |
4 | 12330222122131 |
5 | 214320100121 |
6 | 15322223501 |
7 | 2613535402 |
oct | 674523235 |
9 | 263304021 |
10 | 116565661 |
11 | 5a886563 |
12 | 33054b91 |
13 | 1b1c3984 |
14 | 116a42a9 |
15 | a377e91 |
hex | 6f2a69d |
116565661 has 4 divisors (see below), whose sum is σ = 116662972. Its totient is φ = 116468352.
The previous prime is 116565649. The next prime is 116565677. The reversal of 116565661 is 166565611.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 166565611 = 173 ⋅962807.
It can be written as a sum of positive squares in 2 ways, for example, as 3802500 + 112763161 = 1950^2 + 10619^2 .
It is a cyclic number.
It is not a de Polignac number, because 116565661 - 29 = 116565149 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 116565661.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (116565601) 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, 46836 + ... + 49261.
It is an arithmetic number, because the mean of its divisors is an integer number (29165743).
Almost surely, 2116565661 is an apocalyptic number.
It is an amenable number.
116565661 is a deficient number, since it is larger than the sum of its proper divisors (97311).
116565661 is an equidigital number, since it uses as much as digits as its factorization.
116565661 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 97310.
The product of its digits is 32400, while the sum is 37.
The square root of 116565661 is about 10796.5578310867. The cubic root of 116565661 is about 488.4913489834.
The spelling of 116565661 in words is "one hundred sixteen million, five hundred sixty-five thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •