9284
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
- 3
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 17808
- Proper Divisor Sum (Aliquot Sum)
- 8524
- 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
- 4200
- Möbius Function
- 0
- Radical
- 4642
- Omega Function (Ω)
- 4
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 34
- 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
- Composite numbers k such that the digits of the prime factors of k are either 1 or 2.at n=42A036302
- Even elements of A082931.at n=37A082933
- Maximum number of different determinants that can be produced by permuting the elements of a 3 X 3 integer matrix with nonnegative entries <= n.at n=31A099834
- a(0)=0, a(1)=1; and a(n) = a(n-1) + a(a(n-1) mod n) for n>=2.at n=45A125204
- Number of ways to place 2 nonattacking bishops on an n X n board.at n=11A172123
- Numbers n such that the decimal representation of n is contained as substring in that of the n-th pentagonal number.at n=12A179782
- n^3 + n-th cubefree number.at n=20A180499
- a(n) = smallest k such that k*2^n - 7 is a square.at n=18A188628
- Total number of parts of multiplicity 4 in all partitions of n.at n=36A222704
- Number of partitions of n such that (number of distinct parts) = maximal multiplicity of the parts.at n=45A239964
- Number of partitions p of n such that (maximal multiplicity of the parts of p) = (maximal part of p).at n=53A240312
- a(n) = n*(n^2 - 3*n + 4).at n=22A242659
- Number of n X n 0..3 arrays with some element plus some horizontally, diagonally, antidiagonally or vertically adjacent neighbor totalling three no more than once.at n=2A269187
- Number of nX3 0..3 arrays with some element plus some horizontally, diagonally, antidiagonally or vertically adjacent neighbor totalling three no more than once.at n=2A269189
- T(n,k)=Number of nXk 0..3 arrays with some element plus some horizontally, diagonally, antidiagonally or vertically adjacent neighbor totalling three no more than once.at n=12A269194
- Numbers k such that the decimal number concat(4,k) is a square.at n=28A273359
- Number of nX4 0..1 arrays with no element equal to more than four of its king-move neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=3A281884
- T(n,k)=Number of nXk 0..1 arrays with no element equal to more than four of its king-move neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=24A281888
- G.f. A(x) satisfies: 0 = [x^n] (1+x)^(n*(n+1)/2) / A(x) for n>0.at n=6A304185
- Numbers k such that 357*2^k+1 is prime.at n=43A323003