ICDcodes.org
FY2027

E66Overweight and obesity

Not billable

Is E66 billable?

No — E66 is a non-billable header code. E66 groups more specific codes and cannot be submitted on a claim. A valid ICD-10-CM code must be reported at the highest level of specificity available in its branch. Select one of the 10 billable codes beneath E66.

E66 at a glance

CodeE66
DescriptionOverweight and obesity
BillableNo — header code
Code setICD-10-CM FY2027
Valid for encountersOctober 1, 2026 – September 30, 2027

Code first

The underlying condition below must be sequenced before E66. E66 describes a manifestation and cannot be the principal or first-listed diagnosis.

  • obesity complicating pregnancy, childbirth and the puerperium, if applicable (O99.21-)

Use additional code

Report an additional code alongside E66 to fully describe the condition. E66 is sequenced first.

  • code to identify body mass index (BMI), if known, for adults (Z68.1-Z68.45) or pediatrics (Z68.5-)

Excludes2 — not included here

The conditions below are not part of E66, but a patient may have both at the same time. When documentation supports it, E66 and the excluded code may both be reported.

  • adiposogenital dystrophy (E23.6)
  • lipomatosis dolorosa [Dercum] (E88.2)
  • lipomatosis NOS (E88.2)
  • Prader-Willi syndrome (Q87.11)

Excludes1 — never code together — inherited from Chapter 4

The conditions below can never be reported together with E66 on the same claim. An Excludes1 note means the two conditions cannot occur in the same patient, so reporting both is a coding error.

  • transitory endocrine and metabolic disorders specific to newborn (P70-P74)

What codes fall under E66? (6)

How long has E66 existed?

E66 has been in ICD-10-CM since at least FY2016, the earliest fiscal year on record here.

Derived from the official order files for FY2016–FY2026. FY2017 and FY2020 publish no order file, so those years are not covered.

Which codes are confused with E66?

ICD-10-CM declares these codes mutually exclusive with E66 — exactly one of each pair can be correct for a given encounter.