Base | Representation |
---|---|
bin | 1101110110110… |
… | …01000001001001 |
3 | 22002201012200201 |
4 | 12323121001021 |
5 | 214223413030 |
6 | 15311132201 |
7 | 2610646402 |
oct | 673310111 |
9 | 262635621 |
10 | 116232265 |
11 | 5a679026 |
12 | 32b14061 |
13 | 1b107cb6 |
14 | 116189a9 |
15 | a30e2ca |
hex | 6ed9049 |
116232265 has 4 divisors (see below), whose sum is σ = 139478724. Its totient is φ = 92985808.
The previous prime is 116232241. The next prime is 116232293. The reversal of 116232265 is 562232611.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 562232611 = 43 ⋅13075177.
It can be written as a sum of positive squares in 2 ways, for example, as 42341049 + 73891216 = 6507^2 + 8596^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-116232265 is a prime.
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11623222 + ... + 11623231.
It is an arithmetic number, because the mean of its divisors is an integer number (34869681).
Almost surely, 2116232265 is an apocalyptic number.
It is an amenable number.
116232265 is a deficient number, since it is larger than the sum of its proper divisors (23246459).
116232265 is an equidigital number, since it uses as much as digits as its factorization.
116232265 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23246458.
The product of its digits is 4320, while the sum is 28.
The square root of 116232265 is about 10781.1068541222. The cubic root of 116232265 is about 488.0251837424.
Adding to 116232265 its reverse (562232611), we get a palindrome (678464876).
The spelling of 116232265 in words is "one hundred sixteen million, two hundred thirty-two thousand, two hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •