In a mathematical problem, a positive integer whose sum of all numbers is a multiple of 3 can be divided by 3 and its inverse proposition, no proposition, in the inverse proposition, the number of false propositions is the number of true propositions?

In a mathematical problem, a positive integer whose sum of all numbers is a multiple of 3 can be divided by 3 and its inverse proposition, no proposition, in the inverse proposition, the number of false propositions is the number of true propositions?

Inverse negative proposition: a positive integer that cannot be divided by 3, and the sum of all digits is not a multiple of 3. (true)
Inverse proposition: a positive integer divisible by 3, the sum of all digits is a multiple of 3. (true)
No proposition: the sum of all numbers is not a positive integer multiple of 3 and cannot be divisible by 3