9671
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 5
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 10200
- Proper Divisor Sum (Aliquot Sum)
- 529
- 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
- 9144
- Möbius Function
- 1
- Radical
- 9671
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 73
- 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
- Expansion of (1-x)/((1+x)*(1-2*x)*(1-3*x)).at n=8A004054
- Fibonacci sequence beginning 3, 14.at n=15A022125
- CONTINUANT transform of Fibonacci number 1, 1, 2, 3, 5, 8, ...at n=6A026822
- Surround numbers of an n X 2 rectangle when n is odd.at n=6A061525
- Composite numbers whose divisors (except 1) all contain the digit 9.at n=16A062680
- Variation on Ulam numbers: a(1) = 1; a(2) = 2; for n>2, a(n) is smallest (n odd) or largest (n even) new number that is the sum of two distinct earlier terms.at n=33A081025
- Arrange n^2 octagons that each have area 7 so that they leave (n-1)^2 square gaps each with area 2; a(n) is the total area of these polygons.at n=32A086640
- Number of walks of length n between two vertices on the same triangular face of a truncated tetrahedron (triangular prism).at n=10A094555
- Conjectured lower bound for the number of spheres of radius 1 that can be packed in a sphere of radius n.at n=22A121346
- a(n) is the least exponent e such that 3^e has exactly n consecutive 3's in its decimal representation.at n=6A131550
- Number of partitions of n with exactly one prime number.at n=41A132381
- a(n) = A004001(n)*a(n-1) + a(n-2), for n > 2, with a(1) = a(2) = 1.at n=8A135688
- a(n) = prime(n)^3 mod (n^2 + prime(n)^2).at n=32A243769
- Indices where records occur in A265432.at n=50A272675
- Numbers n such that sum of the proper divisors of n is the square of the sum of the digits of n.at n=7A279459
- The n-th number m such that a nontrivial prime(n)-th root of unity modulo m exists.at n=30A305828
- On a diagonally numbered square grid, with labels starting at 1, this is the number of steps that a (1,n) leaper makes before getting trapped when moving to the lowest available unvisited square, or -1 if it never gets trapped.at n=28A352730
- Number of numbers with sum of digits n in fractional base 4/3.at n=44A364780
- Deficiency of prime-shifted squares: a(n) = 2*A003961(n^2) - sigma(A003961(n^2)), where A003961 is fully multiplicative function with a(prime(i)) = prime(i+1).at n=51A378231
- Integers in Ulam's spiral for which the numbers around them form a square whose four corners are all prime numbers.at n=13A383596