Known-valid RENAVAM
- Input
- 5408830787
- Expected output
- 54088307874
The base's weighted sum, in modulo 11, results in check digit 4.
Carregando ferramenta… / Loading tool…
RENAVAM check digit algorithm
The RENAVAM's 11th digit is computed from the first 10 through a weighted sum in modulo 11, the same principle as a CPF, but with its own weights and rounding rule.
The base's weighted sum, in modulo 11, results in check digit 4.
The same base computes check digit 0; any other final digit (such as the 9 in this invalid example) fails the check.
No. It is a synthetic 11-digit sequence computed only to satisfy the modulo-11 check digit. The tool never queries DENATRAN or any real registry.
The general idea (a weighted sum in modulo 11) is similar, but the weights differ (CPF uses 10 down to 2, RENAVAM uses 3,2,9,8,7,6,5,4,3,2) and the final rule also differs, RENAVAM uses "11 minus the remainder", while CPF uses "sum times 10, modulo 11".
Because when "11 minus the remainder" would give 10 or 11, two digits, the algorithm's rule replaces the result with 0 so it fits a single position.
Yes, paste any 10-digit base in Validate mode (completed with any extra digit) to see the expected digit, or use Generate mode to receive a base with the correct check digit already computed.
The RENAVAM is generated and validated locally in your browser. Analytics receives only the action and status, never the generated or pasted number.