Base | Representation |
---|---|
bin | 110110010110001001… |
… | …0101100110010110101 |
3 | 102011020112012212210102 |
4 | 1230230102230302311 |
5 | 3403004021412230 |
6 | 125340424403445 |
7 | 11301053654462 |
oct | 1545422546265 |
9 | 364215185712 |
10 | 116707216565 |
11 | 4554a1aa1a5 |
12 | 1a751016585 |
13 | b00bc609c4 |
14 | 5911cc8669 |
15 | 3080d7b045 |
hex | 1b2c4accb5 |
116707216565 has 8 divisors (see below), whose sum is σ = 140224384440. Its totient is φ = 93248623552.
The previous prime is 116707216537. The next prime is 116707216567. The reversal of 116707216565 is 565612707611.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 41143254244 + 75563962321 = 202838^2 + 274889^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 116707216565 - 212 = 116707212469 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (116707216567) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 14639330 + ... + 14647299.
It is an arithmetic number, because the mean of its divisors is an integer number (17528048055).
Almost surely, 2116707216565 is an apocalyptic number.
It is an amenable number.
116707216565 is a deficient number, since it is larger than the sum of its proper divisors (23517167875).
116707216565 is an equidigital number, since it uses as much as digits as its factorization.
116707216565 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29287431.
The product of its (nonzero) digits is 529200, while the sum is 47.
The spelling of 116707216565 in words is "one hundred sixteen billion, seven hundred seven million, two hundred sixteen thousand, five hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •