Base | Representation |
---|---|
bin | 11010011011110100000101… |
… | …011011010001101001010001 |
3 | 120020122101211101010222100212 |
4 | 122123310011123101221101 |
5 | 110214303112024143130 |
6 | 1051133210404253505 |
7 | 33326356035166412 |
oct | 3233640533215121 |
9 | 506571741128325 |
10 | 116260560771665 |
11 | 34053910715962 |
12 | 110580aa6a1295 |
13 | 4cb442961c94b |
14 | 209d080d59809 |
15 | d6930d6e1e95 |
hex | 69bd056d1a51 |
116260560771665 has 8 divisors (see below), whose sum is σ = 139512732775080. Its totient is φ = 93008408717952.
The previous prime is 116260560771647. The next prime is 116260560771671. The reversal of 116260560771665 is 566177065062611.
It can be written as a sum of positive squares in 4 ways, for example, as 6497033949184 + 109763526822481 = 2548928^2 + 10476809^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 116260560771665 - 218 = 116260560509521 is a prime.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15438131 + ... + 21699239.
It is an arithmetic number, because the mean of its divisors is an integer number (17439091596885).
Almost surely, 2116260560771665 is an apocalyptic number.
It is an amenable number.
116260560771665 is a deficient number, since it is larger than the sum of its proper divisors (23252172003415).
116260560771665 is an equidigital number, since it uses as much as digits as its factorization.
116260560771665 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9974851.
The product of its (nonzero) digits is 19051200, while the sum is 59.
The spelling of 116260560771665 in words is "one hundred sixteen trillion, two hundred sixty billion, five hundred sixty million, seven hundred seventy-one thousand, six hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •