## You are here

Homesphenic number

## Primary tabs

# sphenic number

Given three primes $p<q<r$, the composite integer $pqr$ is a sphenic number. The first few sphenic numbers are 30, 42, 66, 70, 78, 102, 105, 110, 114, 130, 138, 154, $\ldots$ listed in A007304 of Sloane’s OEIS.

The divisors of a sphenic number therefore are $1,p,q,r,pq,pr,qr,pqr$. Furthermore, $\mu(pqr)=(-1)^{3}$ (where $\mu$ is the Möbius function), $\tau(pqr)=8$ (where $\tau$ is the divisor function) and $\Omega(pqr)=\omega(pqr)=3$ (where $\Omega$ and $\omega$ are the number of (nondistinct) prime factors function and the number of distinct prime factors function, respectively).

The largest known sphenic number at any time is usually the product of the three largest known Mersenne primes.

Type of Math Object:

Definition

Major Section:

Reference

## Mathematics Subject Classification

11A05*no label found*

- Forums
- Planetary Bugs
- HS/Secondary
- University/Tertiary
- Graduate/Advanced
- Industry/Practice
- Research Topics
- LaTeX help
- Math Comptetitions
- Math History
- Math Humor
- PlanetMath Comments
- PlanetMath System Updates and News
- PlanetMath help
- PlanetMath.ORG
- Strategic Communications Development
- The Math Pub
- Testing messages (ignore)

- Other useful stuff

## Recent Activity

Sep 17

new question: numerical method (implicit) for nonlinear pde by roozbe

new question: Harshad Number by pspss

Sep 14

new problem: Geometry by parag

Aug 24

new question: Scheduling Algorithm by ncovella

new question: Scheduling Algorithm by ncovella

new question: numerical method (implicit) for nonlinear pde by roozbe

new question: Harshad Number by pspss

Sep 14

new problem: Geometry by parag

Aug 24

new question: Scheduling Algorithm by ncovella

new question: Scheduling Algorithm by ncovella