9297
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 27
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 13442
- Proper Divisor Sum (Aliquot Sum)
- 4145
- 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
- 6192
- Möbius Function
- 0
- Radical
- 3099
- 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
- 184
- 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
- Expansion of chi(x)^10 / phi(x)^4 in powers of x where phi(), chi() are Ramanujan theta functions.at n=16A002512
- a(n) = Lucas(n+4) - (3*n+7).at n=14A023537
- a(n) = Lucas(2*n+3) - (6*n+4).at n=7A027000
- Duplicate of A023537.at n=14A027962
- Numbers k such that k^2 * 2^k + 1 is prime.at n=20A058780
- Number of compositions of n where the smallest part is greater than the number of parts.at n=45A098132
- Indices of primes in sequence defined by A(0) = 19, A(n) = 10*A(n-1) - 41 for n > 0.at n=16A102017
- Numerators of the convergents to log_2(5).at n=6A116985
- Riordan array ((1-3x+x^2)/(1-4x+3x^2), x(1-2x)/(1-4x+3x^2)).at n=46A147747
- Least number m such that floor((3^n-m)/(2^n-m)) > floor(3^n/2^n).at n=34A153725
- Composite numbers n such that 8*n^2-2*n-1 divides the primitive part U(n) of Fibonacci(n).at n=18A159234
- Record gaps between nonprime prime powers.at n=24A167186
- Numbers n such that Mordell's equation y^2 = x^3 + n has exactly 16 integral solutions.at n=11A179157
- a(n) is the position of the last two-tuple within the reverse lexicographic set of partitions of 2n and 2n+1, with a(1)-a(n) representing the positions of every 2-tuple partition of 2n and 2n+1.at n=25A216053
- Numbers k such that either k^2*2^k-1 or k^2*2^k+1 is prime, but not both.at n=41A237759
- Number of partitions p of n such that (maximal multiplicity of the parts of p) < (number of distinct parts of p).at n=37A240305
- Number of compositions of n into parts 3, 5 and 9.at n=49A245370
- Number of length n+6 0..2 arrays with at most one downstep in every 6 consecutive neighbor pairs.at n=4A255105
- Number of length n+5 0..2 arrays with at most one downstep in every n consecutive neighbor pairs.at n=5A255112
- Number of length 4 1..(n+1) arrays with every leading partial sum divisible by 2 or 3.at n=13A257066