hasDivisorsCount
P114017
predicate
Indicates that an entity (typically a number) is associated with the specific count of its divisors.
Observed surface forms (2)
| Surface form | Occurrences |
|---|---|
| factorCount | 1 |
| hasNumberOfFactors | 1 |
Sample triples (12)
| Subject | Object |
|---|---|
|
highly composite numbers
surface form:
highly composite number
|
1 has 1 divisor ⓘ |
|
highly composite numbers
surface form:
highly composite number
|
2 has 2 divisors ⓘ |
|
highly composite numbers
surface form:
highly composite number
|
4 has 3 divisors ⓘ |
|
highly composite numbers
surface form:
highly composite number
|
6 has 4 divisors ⓘ |
|
highly composite numbers
surface form:
highly composite number
|
12 has 6 divisors ⓘ |
|
highly composite numbers
surface form:
highly composite number
|
24 has 8 divisors ⓘ |
|
highly composite numbers
surface form:
highly composite number
|
36 has 9 divisors ⓘ |
|
highly composite numbers
surface form:
highly composite number
|
48 has 10 divisors ⓘ |
|
highly composite numbers
surface form:
highly composite number
|
60 has 12 divisors ⓘ |
|
highly composite numbers
surface form:
highly composite number
|
120 has 16 divisors ⓘ |
| Ariyo Atthangiko Maggo | 8 via predicate surface "hasNumberOfFactors" ⓘ |
| Barker balancing test | 4 via predicate surface "factorCount" ⓘ |