9179
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 26
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 9384
- Proper Divisor Sum (Aliquot Sum)
- 205
- 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
- 8976
- Möbius Function
- 1
- Radical
- 9179
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- yes
- 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
- a(n) = C(n+2,3) + C(n,3) + C(n-1,3).at n=26A006004
- f-vectors for simplicial complexes of dimension at most 1 (graphs) on at most n-1 vertices.at n=38A011826
- arctan(exp(x)-cos(x))=x+2/2!*x^2-1/3!*x^3-24/4!*x^4-115/5!*x^5...at n=6A013313
- Eight iterations of Reverse and Add are needed to reach a palindrome.at n=36A015988
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 95.at n=13A031593
- Numbers which need eight 'Reverse and Add' steps to reach a palindrome.at n=31A065213
- Solutions k of the equation phi(k) = phi(k-1) + phi(k-2). Also known as Phibonacci numbers.at n=21A065557
- Composite numbers k such that phi(k) = phi(k-1) + phi(k-2).at n=3A065572
- Smallest solution m to (n+1)*phi(m) = n*sigma(m), or -1 if no solution exists.at n=21A065824
- a(n) = A065824(A047845(n+1)).at n=8A065884
- Nonprime numbers n such that q=phi(n)/(sigma(n)-n-1) is an integer and n is not a prime square.at n=45A070161
- Least x = a(n) such that sum of common prime divisors (without multiplicity) of sigma(x) and phi(x) equals n, or 0 if such number (apparently) does not exist.at n=21A082056
- Indices of primes in sequence defined by A(0) = 53, A(n) = 10*A(n-1) + 13 for n > 0.at n=11A101579
- Composite terms in A143578.at n=44A142591
- a(n) = (3*n+2)*(3*n+5)/2.at n=44A178977
- a(n) = 8*n^2 + 14*n + 5.at n=33A181890
- Triangle of coefficients of polynomials v(n,x) jointly generated with A209168; see the Formula section.at n=48A209169
- Number of 0..n arrays of length 3 with 0 never adjacent to n.at n=19A212836
- Smallest magic sum of an order-n magic square composed of consecutive Smith numbers.at n=6A213689
- Lucas pseudoprimes.at n=8A217120