9471
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 16128
- Proper Divisor Sum (Aliquot Sum)
- 6657
- 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
- 4800
- Möbius Function
- 1
- Radical
- 9471
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 153
- 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
- MacMahon's generalized sum of divisors function.at n=40A002127
- Octagonal pyramidal numbers: a(n) = n*(n+1)*(2*n-1)/2.at n=20A002414
- Nearest integer to Gamma(n + 6/11)/Gamma(6/11).at n=8A020009
- Ceiling of Gamma(n+6/11)/Gamma(6/11).at n=8A020099
- Numbers k not ending in 0 such that for some base b, k_b is the reverse of k_10 (where k_b denotes k written in base b).at n=44A034294
- Sum{T(i,n-i): i=0,1,...,n}, array T as in A047150.at n=14A047151
- a(n)=a(n-1)+a(n-2)-d, where d=a(n/2) if n is even, else d=0; 2 initial terms.at n=23A050192
- Iterated procedure 'composite k added to sum of its prime factors reaches a prime' yields 6 skipped primes.at n=42A050773
- Convolution of Fibonacci F(n+1), n>=0, with F(n+4), n>=0.at n=12A067332
- a(n) = (n+1)*(2*n+1)*(4*n+1).at n=10A079588
- Triangle, read by rows, where the n-th row lists the (2n+1) coefficients of (1 + x + 3x^2)^n.at n=57A084602
- 47-gonal numbers.at n=20A095311
- Structured icosidodecahedral numbers.at n=10A100147
- G.f. satisfies: A(x) = 1/(1 + x*A(x^3)) and also the continued fraction: 1+x*A(x^4) = [1;1/x,1/x^3,1/x^9,1/x^27,...,1/x^(3^(n-1)),...].at n=26A101913
- Partial sums of A107947.at n=45A107957
- a(n) = (10^k - n)(10^k + n), where k is the number of digits in n.at n=22A110397
- a(n) = binomial(n,3) - binomial(floor(n/2),3) - binomial(ceiling(n/2),3).at n=43A111384
- Denominators of z-sequence for the Sheffer matrix (triangle) A094816 (coefficients of Poisson-Charlier polynomials).at n=40A130190
- A sequence of asymptotic density zeta(9) - 1, where zeta is the Riemann zeta function.at n=18A143035
- 11 times triangular numbers.at n=41A152740