Base | Representation |
---|---|
bin | 110110011101110110… |
… | …1001110101111011101 |
3 | 102011220112211210011212 |
4 | 1230323231032233131 |
5 | 3404021223021342 |
6 | 125422223354205 |
7 | 11310344101361 |
oct | 1547355165735 |
9 | 364815753155 |
10 | 116965829597 |
11 | 45672185a81 |
12 | 1a803752965 |
13 | b0506ca876 |
14 | 59383a72a1 |
15 | 3098912182 |
hex | 1b3bb4ebdd |
116965829597 has 2 divisors, whose sum is σ = 116965829598. Its totient is φ = 116965829596.
The previous prime is 116965829549. The next prime is 116965829609. The reversal of 116965829597 is 795928569611.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 83586904996 + 33378924601 = 289114^2 + 182699^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-116965829597 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (116935829597) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 58482914798 + 58482914799.
It is an arithmetic number, because the mean of its divisors is an integer number (58482914799).
Almost surely, 2116965829597 is an apocalyptic number.
It is an amenable number.
116965829597 is a deficient number, since it is larger than the sum of its proper divisors (1).
116965829597 is an equidigital number, since it uses as much as digits as its factorization.
116965829597 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 73483200, while the sum is 68.
The spelling of 116965829597 in words is "one hundred sixteen billion, nine hundred sixty-five million, eight hundred twenty-nine thousand, five hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •