|
SIRET Code
The SIRET code (French: ''Système d’identification du répertoire des établissements''), or SIRET number, is an INSEE code which allows the geographic identification of any French establishment or business. Construction This 14-figure numerical identifier is split into two parts: * the first is the SIREN code of the legal unit to which the SIRET unit belongs; * the second is usually called the NIC (internal ranking number; French: ''Numéro interne de classement''), and is made up of a four-figure number attributed to the establishment and a control figure used to validate the SIRET number as a whole. For example, 732 829 320 00074 would refer to the seventh establishment (followed by 4 as the check digit) of the business with SIREN number 732 829 320. Calculating a valid code The SIRET number's check digit (the last) that verifies the validity of the SIRET number (SIREN + NIC). It is calculated using the Luhn formula. See also * INSEE * SIREN code SIREN codes are ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
SIREN Code
SIREN codes are given to French businesses and nonprofit associations, SIRET codes to their establishments and facilities. SIREN codes are maintained by the French INSEE. This is France-specific, and will not change during the lifetime of the business. SIREN codes have 9 digits. The first 8 digits are the business reference, the last one is a check digit A check digit is a form of redundancy check used for Error detection and correction, error detection on identification numbers, such as bank account numbers, which are used in an application where they will at least sometimes be input manually. It .... French public organizations have 1 or 2 as the first digit. The check digit uses the Luhn algorithm. See also * SIRET code External links Definitionon the INSEE website SIRENE database Geography of France Statistical data coding {{France-stub ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Luhn Formula
The Luhn algorithm or Luhn formula (creator: IBM scientist Hans Peter Luhn), also known as the " modulus 10" or "mod 10" algorithm, is a simple check digit formula used to validate a variety of identification numbers. The algorithm is in the public domain and is in wide use today. It is specified in ISO/IEC 7812-1. It is not intended to be a cryptographically secure hash function; it was designed to protect against accidental errors, not malicious attacks. Most credit card numbers and many government identification numbers use the algorithm as a simple method of distinguishing valid numbers from mistyped or otherwise incorrect numbers. Description The check digit is computed as follows: # Drop the check digit from the number (if it's already present). This leaves the payload. # Start with the payload digits. Moving from right to left, double every second digit, starting from the last digit. If doubling a digit results in a value > 9, subtract 9 from it (or sum its digits). # ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |