Base | Representation |
---|---|
bin | 11010011101000001001111… |
… | …111101010111000111011001 |
3 | 120020221022200200010100000221 |
4 | 122131001033331113013121 |
5 | 110222132303343141302 |
6 | 1051235232143000041 |
7 | 33335351203462435 |
oct | 3235011775270731 |
9 | 506838620110027 |
10 | 116343415599577 |
11 | 34085a69048451 |
12 | 11070172599021 |
13 | 4cbc1a203a73a |
14 | 20a30a0d0b9c5 |
15 | d6b55c62a937 |
hex | 69d04ff571d9 |
116343415599577 has 4 divisors (see below), whose sum is σ = 116345513558196. Its totient is φ = 116341317640960.
The previous prime is 116343415599563. The next prime is 116343415599589. The reversal of 116343415599577 is 775995514343611.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 49522338658521 + 66821076941056 = 7037211^2 + 8174416^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-116343415599577 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (116343415599077) 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, 1048896124 + ... + 1049007037.
It is an arithmetic number, because the mean of its divisors is an integer number (29086378389549).
Almost surely, 2116343415599577 is an apocalyptic number.
It is an amenable number.
116343415599577 is a deficient number, since it is larger than the sum of its proper divisors (2097958619).
116343415599577 is an equidigital number, since it uses as much as digits as its factorization.
116343415599577 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2097958618.
The product of its digits is 428652000, while the sum is 70.
The spelling of 116343415599577 in words is "one hundred sixteen trillion, three hundred forty-three billion, four hundred fifteen million, five hundred ninety-nine thousand, five hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •