Base | Representation |
---|---|
bin | 11010100000110100000110… |
… | …011110100011011101111101 |
3 | 120021212020202111102121020101 |
4 | 122200310012132203131331 |
5 | 110240420323000320442 |
6 | 1051555115134521101 |
7 | 33363242114523535 |
oct | 3240640636433575 |
9 | 507766674377211 |
10 | 116604175791997 |
11 | 3417660a408503 |
12 | 110b2806666191 |
13 | 500a95a43c89a |
14 | 20b195a8084c5 |
15 | d7321ee14cb7 |
hex | 6a0d067a377d |
116604175791997 has 2 divisors, whose sum is σ = 116604175791998. Its totient is φ = 116604175791996.
The previous prime is 116604175791973. The next prime is 116604175792021. The reversal of 116604175791997 is 799197571406611.
It is a balanced prime because it is at equal distance from previous prime (116604175791973) and next prime (116604175792021).
It can be written as a sum of positive squares in only one way, i.e., 78132499669081 + 38471676122916 = 8839259^2 + 6202554^2 .
It is a cyclic number.
It is not a de Polignac number, because 116604175791997 - 231 = 116602028308349 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (116604175711997) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 58302087895998 + 58302087895999.
It is an arithmetic number, because the mean of its divisors is an integer number (58302087895999).
Almost surely, 2116604175791997 is an apocalyptic number.
It is an amenable number.
116604175791997 is a deficient number, since it is larger than the sum of its proper divisors (1).
116604175791997 is an equidigital number, since it uses as much as digits as its factorization.
116604175791997 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 180033840, while the sum is 73.
The spelling of 116604175791997 in words is "one hundred sixteen trillion, six hundred four billion, one hundred seventy-five million, seven hundred ninety-one thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •