REGEXVAULTv2.0
Finance/Tax & Registration
Verified Safe

Australian Business Number (ABN) Regex for Java

/^[0-9]{2}\s?[0-9]{3}\s?[0-9]{3}\s?[0-9]{3}$/

What this pattern does

This page provides a well-structured, multi-part regular expression for matching australian business number (abn), ported and verified for Java. Financial data validation has zero tolerance for false negatives — a missed invalid entry can corrupt downstream calculations. The snippet below is ready to drop into your Java project — whether you're validating in a Spring Boot controller, a Jakarta EE service, or a standalone utility class.

Java Implementation

Java
// Australian Business Number (ABN)
// ReDoS-safe | RegexVault — Finance > Tax & Registration

import java.util.regex.Pattern;

public class AustralianBusinessNumberAbnValidator {
    private static final Pattern PATTERN =
        Pattern.compile("^[0-9]{2}\\s?[0-9]{3}\\s?[0-9]{3}\\s?[0-9]{3}$");

    public static boolean validate(String input) {
        return PATTERN.matcher(input).matches();
    }

    // Example
    public static void main(String[] args) {
        System.out.println(validate("51824753556")); // true
    }
}

Test Cases

Matches (Valid)
Rejects (Invalid)
518247535565182475355
51 824 753 556518247535560
53 004 085 61651-824-753-556
83 914 571 673AB 824 753 556

When to use this pattern

This pattern is drawn from the Finance > Tax & Registration category and carries a ReDoS-safe certification. That matters for Java developers because critical in Java applications since the JVM regex engine uses backtracking and is susceptible to ReDoS without careful pattern design. RegexVault audits patterns against known backtracking attack vectors, ensuring you have the necessary context before using this regex in a high-stakes production environment.

Common Pitfalls

ABN and ACN (Australian Company Number) are different. ACN is 9 digits, ABN is 11 digits (ACN + 2 check digits). GST registration requires a valid ABN.

Technical Notes

Format validation only. ABN checksum: subtract 1 from first digit, multiply each by weight (10,1,3,5,7,9,11,13,15,17,19), sum, divide by 89, remainder must be 0. Validate via ABR (Australian Business Register) for active status.

Have a pattern that belongs in the vault?

Submit it for review — community-verified patterns get credited to your GitHub handle. Free submissions join the queue. Priority review available for $15.

Submit a Pattern