9408
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
- 1
Divisibility
- Divisor Count
- 42
- Divisor Sum
- 28956
- Proper Divisor Sum (Aliquot Sum)
- 19548
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2688
- Möbius Function
- 0
- Radical
- 42
- Omega Function (Ω)
- 9
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 122
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- yes
- Odd
- no
Appears in sequences
- Number of reduced Latin squares of order n; also number of labeled loops (quasigroups with an identity element) with a fixed identity element.at n=5A000315
- Triangle giving number L(n,k) of normalized k X n Latin rectangles.at n=20A001009
- Triangle giving number L(n,k) of normalized k X n Latin rectangles.at n=19A001009
- Theta series of 6-dimensional lattice A_6^(2) (other names for this lattice or the corresponding quadratic form are LAMBDA_{3,lambda}, P_6^(5), phi_6, F_14).at n=43A002706
- Coefficients of Chebyshev T polynomials: a(n) = A053120(n+8, n), n >= 0.at n=6A006974
- Numbers k such that the standard deviation of 1,...,k is an integer.at n=4A007654
- Floor-factorial numbers: a(n) = Product_{k=1..n} floor(n/k).at n=14A010786
- Theta series of lattice Kappa_9.at n=7A015233
- Least k such that k and 4k are anagrams in base n (written in base 10).at n=10A023096
- a(n) = position of n^3 + (n+1)^3 + (n+2)^3 in A024975.at n=30A024980
- Words over signatures (derived from multisets and multinomials).at n=38A035796
- Numbers that are divisible by exactly 9 primes with multiplicity.at n=41A046312
- a(n)=(1/2)*T(2n,n), where T is given by A048113.at n=8A048117
- a(n)=T(2n+1,n+1), where T is given by A048113.at n=9A048118
- a(n) = n^2 * phi(n).at n=27A053191
- McKay-Thompson series of class 32B for the Monster group.at n=35A058630
- Number of conjugacy classes in the group GL_2(K) when K is a finite field with q = p^m for a prime p and m >= 1.at n=34A060615
- Let f(h) = A141900(h) = 2^h * 3^i * 5^j * ... be the smallest term in A141586 that is divisible by 2^h but not by 2^(h+1). Sequence gives values of h where i increases.at n=32A062247
- Number of divisors of n-th term of sequence a(n+1) = a(n)*(a(0) + ... + a(n)) (A001697).at n=8A062962
- a(n) = (9*n^2 + 13*n + 6)/2.at n=45A064226