HOME

TheInfoList



OR:

In
elementary number theory Number theory (or arithmetic or higher arithmetic in older usage) is a branch of pure mathematics devoted primarily to the study of the integers and integer-valued functions. German mathematician Carl Friedrich Gauss (1777–1855) said, "Mathe ...
, a highly powerful number is a positive integer that satisfies a property introduced by the Indo-Canadian mathematician Mathukumalli V. Subbarao. The set of highly powerful numbers is a proper subset of the set of
powerful number A powerful number is a positive integer ''m'' such that for every prime number ''p'' dividing ''m'', ''p''2 also divides ''m''. Equivalently, a powerful number is the product of a square and a cube, that is, a number ''m'' of the form ''m'' = ''a ...
s. Define prodex(1) = 1. Let n be a positive integer, such that n = \prod_^k p_i^ , where p_1, \ldots , p_k are k distinct primes in increasing order and e_(n) is a positive integer for i = 1, \ldots ,k. Define \operatorname(n) = \prod_^k e_(n). The positive integer n is defined to be a highly powerful number if and only if, for every positive integer m,\, 1 \le m < n implies that \operatorname(m) < \operatorname(n). The first 25 highly powerful numbers are: 1, 4, 8, 16, 32, 64, 128, 144, 216, 288, 432, 864, 1296, 1728, 2592, 3456, 5184, 7776, 10368, 15552, 20736, 31104, 41472, 62208, 86400.


References

{{reflist Integer sequences