How many trailing zeroes would there be in the number 2188! when expressed in base 6?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
To determine the number of trailing zeroes in base b of given integer n ! , we to need find the greatest prime factor of given base. Since prime factors of 6 = 2 × 3 . Now we can perform T z ( n ) = k = 1 ∑ ∞ ⌊ 3 k n ⌋ ∴ T z ( 2 1 8 8 ) = ⌊ 3 2 1 8 8 ⌋ + ⌊ 3 2 2 1 8 8 ⌋ + ⌊ 3 3 2 1 8 8 ⌋ + ⋯ T z ( 2 1 8 8 ) = 7 2 9 + 2 4 3 + 8 1 + 2 7 + 9 + 3 + 1 + 0 + ⋯ T z ( 2 1 8 8 ) = 1 0 9 3
Note: It is also important to note down the total number of 2 ′ s in given n .