Base | Representation |
---|---|
bin | 110110011001001110… |
… | …1000000000001010101 |
3 | 102011111201201021211202 |
4 | 1230302131000001111 |
5 | 3403212002030203 |
6 | 125355000042245 |
7 | 11303450355656 |
oct | 1546235000125 |
9 | 364451637752 |
10 | 116810580053 |
11 | 455a2588772 |
12 | 1a77b763385 |
13 | b0274b142b |
14 | 592191352d |
15 | 3089e97388 |
hex | 1b32740055 |
116810580053 has 2 divisors, whose sum is σ = 116810580054. Its totient is φ = 116810580052.
The previous prime is 116810580041. The next prime is 116810580071. The reversal of 116810580053 is 350085018611.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 86958342769 + 29852237284 = 294887^2 + 172778^2 .
It is a cyclic number.
It is not a de Polignac number, because 116810580053 - 212 = 116810575957 is a prime.
It is a super-2 number, since 2×1168105800532 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 116810579989 and 116810580016.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (116810580253) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 58405290026 + 58405290027.
It is an arithmetic number, because the mean of its divisors is an integer number (58405290027).
Almost surely, 2116810580053 is an apocalyptic number.
It is an amenable number.
116810580053 is a deficient number, since it is larger than the sum of its proper divisors (1).
116810580053 is an equidigital number, since it uses as much as digits as its factorization.
116810580053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 28800, while the sum is 38.
Adding to 116810580053 its reverse (350085018611), we get a palindrome (466895598664).
The spelling of 116810580053 in words is "one hundred sixteen billion, eight hundred ten million, five hundred eighty thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •