9251
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 10452
- Proper Divisor Sum (Aliquot Sum)
- 1201
- 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
- 8120
- Möbius Function
- 0
- Radical
- 319
- 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
- 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
- no
- Odd
- yes
Appears in sequences
- Coordination sequence for Ni2In, Position Ni1 and In.at n=29A009941
- a(n) = 11*n^2.at n=29A033584
- Number of partitions of n into parts not of form 4k+2, 20k, 20k+7 or 20k-7. Also number of partitions in which no odd part is repeated, with at most 3 parts of size less than or equal to 2 and where differences between parts at distance 4 are greater than 1 when the smallest part is odd and greater than 2 when the smallest part is even.at n=48A036027
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2*n - 3 - 2^(p+1) and p is the unique value such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = a(2) = 1 and a(3) = 3.at n=42A050032
- a(n) = a(n-1) + a(m) for n >= 3, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1 and a(2) = 2.at n=42A050048
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1 and a(2) = a(3) = 3.at n=42A050064
- Truncated triangular pyramid numbers: a(n) = (n-5)*(n^2 + 8*n - 66)/6.at n=32A051939
- a(n)^2 is a square whose digits occur with an equal minimum frequency of 2.at n=40A052049
- Numbers from A066112 that are neither square nor twice a square, i.e., are not in A028982 but are in A028983.at n=34A066134
- Number of partitions of the n-th decimal palindrome into distinct decimal palindromes.at n=38A091585
- Numerator of Euler(n,6).at n=5A157827
- A triangle sequence derived from setting an Euler numbers A122045 generalization equal to the MacMahon numbers A060187 to get a generating function expansion: p(x,t) = (exp(t)* (1 - exp(x))* x)/(exp(2 t + t x) + exp(t)* x - exp(t*x)* x).at n=38A178234
- Values A such that p=prime(n) satisfies binomial(2p-1, p-1) == 1 + A*p (mod p^4).at n=9A260209
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 846", based on the 5-celled von Neumann neighborhood.at n=30A273689
- a(n) = Euler(n, n+1) * 2^valuation(n+1, 2), where Euler(n, x) denotes the Euler polynomial.at n=5A291982
- Sums of positive coefficients in generalized Chebyshev polynomials of the first kind, for a family of 5 data.at n=5A301420
- Numbers k coprime to 10 such that there are exactly two values of A for which k^2+4*A and k^2-4*A are perfect squares.at n=37A325421
- Numbers k such that k![4] - 128 is prime, where k![4] = A007662(k) = quadruple factorial.at n=34A329176
- Number of ways to write n as an ordered sum of 5 squarefree numbers.at n=30A341065
- Row sums of A342000.at n=16A342020