9367
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 10800
- Proper Divisor Sum (Aliquot Sum)
- 1433
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8064
- Möbius Function
- -1
- Radical
- 9367
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 3
Special
- Factorial
- no
- Catalan Number
- no
- Bell Number
- no
- Motzkin Number
- no
- Primorial
- no
Figurate Numbers
- Fibonacci Number
- no
- Triangular Number
- no
- Perfect Square
- no
- Perfect Cube
- no
- Pentagonal Number
- no
- Hexagonal Number
- no
- Lucas Number
- no
- Tetrahedral Number
- no
- Pell Number
- no
- Tribonacci Number
- no
- Pronic Number
- no
Recreational
- Happy Number
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 60
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- no
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Numbers k such that k, k+1, k+2 and k+3 have the same number of divisors.at n=7A006601
- a(n) = n*(13*n - 1)/2.at n=38A022270
- Numbers whose maximal base-8 run length is 4.at n=29A037995
- Sets of 4 consecutive numbers with equal number of divisors.at n=28A039665
- Numbers having four 2's in base 8.at n=14A043432
- E.g.f.: exp(x)-1+log(-1/(-2+exp(x))).at n=7A052877
- a(n) = (1/24)*(n+1)*(n+3)*(n^2+22*n+88).at n=17A090950
- Generalized Bell numbers B_{7,2}.at n=2A091749
- Consider the family of multigraphs enriched by the species of even sets. Sequence gives number of those multigraphs with 2n edges.at n=4A098632
- Let S(1) = {1} and, for n>1 let S(n) be the smallest set containing x, 2x and x+2 for each element x in S(n-1). a(n) is the number of elements in S(n).at n=18A122554
- Partial sums of A151779.at n=33A151781
- Multiples of 19 whose digit reversal - 1 is also a multiple of 19.at n=22A166399
- [s(k)-s(j)]/8, where the pairs (k,j) are given by A205867 and A205868, and s(k) denotes the (k+1)-st Fibonacci number.at n=40A205870
- Number of indecomposable permutations sortable using two parallel stacks.at n=8A215252
- Number of partitions p of n such that max(p) - min(p) = 10.at n=34A218573
- Hilltop maps: number of nX7 binary arrays indicating the locations of corresponding elements not exceeded by any horizontal, diagonal or antidiagonal neighbor in a random 0..1 nX7 array.at n=1A219077
- T(n,k)=Hilltop maps: number of nXk binary arrays indicating the locations of corresponding elements not exceeded by any horizontal, diagonal or antidiagonal neighbor in a random 0..1 nXk array.at n=29A219078
- Hilltop maps: number of 2Xn binary arrays indicating the locations of corresponding elements not exceeded by any horizontal, diagonal or antidiagonal neighbor in a random 0..1 2Xn array.at n=6A219079
- Composite squarefree numbers n such that p(i)+7 divides n-7, where p(i) are the prime factors of n.at n=3A225717
- 25-gonal numbers: a(n) = n*(23*n-21)/2.at n=29A255184