Questions concerning the lengths of factorizations into irreducible elements in numerical monoids have gained much attention in the recent literature. In this note, we show that a numerical monoid has an element with two different irreducible factorizations of the same length if and only if its embedding dimension is greater than two. We find formulas in embedding dimension three for the smallest element with two different irreducible factorizations of the same length and the largest element whose different irreducible factorizations all have distinct lengths. We show that these formulas do not naturally extend to higher embedding dimensions.

We say that a numerical semigroup is \emph{$d$-squashed} if it can be written in the form $$ S=\frac 1 N \langle a_1,\dots,a_d \rangle \cap \mathbb{Z}$$ for $N,a_1,\dots,a_d$ positive integers with $\gcd(a_1,\dots, a_d)=1$. Rosales and Urbano have shown that a numerical semigroup is 2-squashed if and only if it is proportionally modular. Recent works by Rosales \emph{et al.} give a concrete example of a numerical semigroup that cannot be written as an intersection of $2$-squashed semigroups. We will show the existence of infinitely many numerical semigroups that cannot be written as an intersection of $2$-squashed semigroups. We also will prove the same result for $3$-squashed semigroups. We conjecture that there are numerical semigroups that cannot be written as the intersection of $d$-squashed semigroups for any fixed $d$, and we prove some partial results towards this conjecture.