9438
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 22344
- Proper Divisor Sum (Aliquot Sum)
- 12906
- 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
- 2640
- Möbius Function
- 0
- Radical
- 858
- Omega Function (Ω)
- 5
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 104
- 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
- Reverse digits of number of partitions of n.at n=32A004089
- Column of Motzkin triangle.at n=8A005323
- Coordination sequence for MgCu2, Cu position.at n=24A009930
- Fibonacci sequence beginning 4, 13.at n=15A022132
- a(n) = number of (s(0), s(1), ..., s(n)) such that s(i) is a nonnegative integer and |s(i) - s(i-1)| = 1 for i = 1,2,...,n and s(0) = 2. Also a(n) = sum of numbers in row n+1 of array T defined in A026009.at n=14A026010
- Even numbers in the (1,2)-Pascal triangle A029635 that are different from 2.at n=51A029641
- Numbers to the left of the central numbers of the (1,2)-Pascal triangle A029635.at n=63A029644
- Numbers to the left of the central elements of the (1,2)-Pascal triangle A029635 that are different from 1.at n=48A029645
- Even numbers to the left of the central elements of the (1,2)-Pascal triangle A029635.at n=30A029647
- Even numbers in the (2,1)-Pascal triangle A029653 that are different from 2.at n=51A029659
- Even numbers to the right of the central numbers of the (2,1)-Pascal triangle A029653.at n=27A029661
- Numbers to the right of the central elements of the (2,1)-Pascal triangle A029653 that are different from 1.at n=42A029663
- Numbers to the right of the central elements of the (2,1)-Pascal triangle A029653.at n=56A029666
- 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 64.at n=27A031562
- Triangle read by rows: T(n,k) = number of 2 X inf arrays [ n, n1, n2, ...; k, k1, k2,... ] with n>=n1>n2>...>=0, k>=k1>k2...>=0, n>k, n1>k1, ...; n >= 1, k >= 0. Note that once ni or ki = 0, the strict inequalities become equalities (constant 0 thereafter).at n=34A039597
- a(n) = binomial(2*n,n) - binomial(2*n-2,n-1); or (3n-2)*C(n-1), where C = Catalan numbers (A000108).at n=7A051924
- a(n) = binomial(n+7, 7)*(n+4)/4.at n=7A053347
- a(n) = (3*n+4)*binomial(n+7, 7)/4.at n=6A054487
- T(2n+4,n), array T as in A055794.at n=10A055797
- Numbers n such that 10*11^n + 1 is prime.at n=5A057462