9351
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 13520
- Proper Divisor Sum (Aliquot Sum)
- 4169
- 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
- 6228
- Möbius Function
- 0
- Radical
- 3117
- Omega Function (Ω)
- 3
- 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
- 109
- 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
- no
- Odd
- yes
Appears in sequences
- a(n) = a(n-1) + a(n-2) - 2, a(0) = 4, a(1) = 3.at n=19A000211
- Number of maximum matchings in the n-Moebius ladder M_n.at n=19A020878
- Numbers whose set of base-13 digits is {3,4}.at n=25A032837
- Numerators of continued fraction convergents to sqrt(354).at n=5A041670
- Expansion of (1 - x + 3*x^3 - 2*x^4 - 3*x^5)/(1 - 2*x + x^3).at n=19A048162
- A Diaconis-Mosteller approximation to the Birthday problem function.at n=41A050255
- The (2^n)-th composite number.at n=13A065856
- a(1) = 3; a(n) is smallest number > a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.at n=46A074339
- 63-gonal numbers: a(n) = n*(61*n - 59)/2.at n=18A098140
- French self-ranked numbers.at n=47A108987
- Start with 1013 and repeatedly reverse the digits and add 2 to get the next term.at n=38A120214
- Number of 2-anisohedral polyiamonds of order n.at n=28A121308
- a(n) = a(n-1) + a(n-3) + a(n-5).at n=19A122115
- Inverse Moebius transform of A100107.at n=18A130878
- a(n) = (n^3 + 18*n^2 + 17*n + 6)/6.at n=33A143058
- Triangle T(n,k) = 3*binomial(n, k)^2 - binomial(n, k) - 1, read by rows.at n=39A144404
- Triangle T(n,k) = 3*binomial(n, k)^2 - binomial(n, k) - 1, read by rows.at n=41A144404
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 0, 1), (1, 0, -1), (1, 1, 0)}.at n=9A148713
- a(n) is the number of perfect matchings of an edge-labeled 2 X (2n+1) Mobius grid graph.at n=9A162483
- a(n) = 12*n^2 - 2*n - 1.at n=28A185918