// Workers AI · dad joke modeWhy was 96 sad? It had a percent of problems.
| ||||
|---|---|---|---|---|
| Cardinal | ninety-six | |||
| Ordinal | 96th (ninety-sixth) | |||
| Factorization | 25 × 3 | |||
| Divisors | 1, 2, 3, 4, 6, 8, 12, 16, 24, 32, 48, 96 | |||
| Greek numeral | ϞϚ´ | |||
| Roman numeral | XCVI, xcvi | |||
| Binary | 11000002 | |||
| Ternary | 101203 | |||
| Senary | 2406 | |||
| Octal | 1408 | |||
| Duodecimal | 8012 | |||
| Hexadecimal | 6016 | |||
96 (ninety-six) is the natural number following 95 and preceding 97.
In mathematics
[edit]
96 is an octagonal number,[1] a refactorable number,[2] and an untouchable number.[3] It is a semiperfect number since it is a multiple of a perfect number, namely 6. It is the fourth Granville number and the second non-perfect Granville number. It is an abundant number since the sum of its proper divisors, 156, is greater than 96. 96 has 12 divisors.[4] As no smaller number has 12 or more divisors, 96 is a largely composite number.[5]
96 is an Erdős–Woods number, since it is possible to find sequences of 96 consecutive integers such that each inner member shares a factor with either the first or the last member.[6]
96 is strobogrammatic in bases 10 (9610), 11 (8811) and 95 (1195). It ispalindromic in bases 11 (8811), 15 (6615), 23 (4423), 31 (3331), 47 (2247) and 95 (1195).
96 is the sum of Euler's totient function φ(x) over the first seventeen integers.
96 is the smallest natural number that can be expressed as the difference of two nonzero squares in more than three ways:
96 = = = = .[7]
Skilling's figure, a degenerate uniform polyhedron, has Euler characteristic
Every integer greater than 96 may be represented as a sum of distinct super-prime numbers.
References
[edit]- ↑ "Sloane's A000567 : Octagonal numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-28.
- ↑ "Sloane's A033950: Refactorable numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-28.
- ↑ "Sloane's A005114 : Untouchable numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-28.
- ↑ Sloane, N. J. A. (ed.). "Sequence A000005 (d(n) (also called tau(n) or sigma_0(n)), the number of divisors of n.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A067128 (Ramanujan's largely composite numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ "Sloane's A059756 : Erdős-Woods numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-28.
- ↑ Sloane, N. J. A. (ed.). "Sequence A334078". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.