9247
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 10576
- Proper Divisor Sum (Aliquot Sum)
- 1329
- 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
- 7920
- Möbius Function
- 1
- Radical
- 9247
- Omega Function (Ω)
- 2
- 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
- yes
- Squarefree Number
- yes
- 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
- Catalan numbers written backwards.at n=13A004096
- a(0) = 1, a(n) = 5*n^2 + 2 for n>0.at n=43A010001
- Eleven iterations of Reverse and Add are needed to reach a palindrome.at n=35A015992
- a(n) = Sum_{k=0..2n-1} T(n,k) * T(n,k+1), with T given by A027113.at n=4A027141
- 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 95.at n=20A031593
- Number of planar partitions of n, but partitions that are mirror images of each other (when regarded as 3-D objects) are counted only once.at n=16A048140
- Duplicate of A048140.at n=16A048238
- a(n) = a(1) + a(2) + ... + a(n-1) - a(m), where m = 2^(p+1) + 2 - n and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = a(2) = 1 and a(3) = 2.at n=15A049889
- Numbers n such that the trinomial x^n + x + 1 is irreducible over GF(5).at n=21A058334
- Numbers which need eleven 'Reverse and Add' steps to reach a palindrome.at n=33A065216
- Nested floor product of n and fractions (k+1)/k for all k>0 (mod 6), divided by 6.at n=11A073363
- Row sums of triangle A109282.at n=6A109286
- Triangle read by rows: T(n,k) is the number of deco polyominoes of height n and having k 2-cell columns (n>=1; 0<=k<=n-1). A deco polyomino is a directed column-convex polyomino in which the height, measured along the diagonal, is attained only in the last column.at n=51A121637
- a(n) is the smallest number such that twice the number of divisors of (a(n)-n)/3 gives the n-th term in the first differences of the sequence produced by the Flavius Josephus sieve, A000960.at n=30A130826
- a(n) = n*(n-th prime) + (n+1)*((n+1)-th prime).at n=32A152117
- a(n) = 8*n^2 - 1.at n=33A157914
- a(n) = 289*n - 1.at n=31A158253
- a(n) = 32*n^2 - 1.at n=16A158563
- Number of (n+1) X 2 0..3 arrays with every 2 X 2 subblock sum greater than 6.at n=2A184209
- Number of (n+1) X 4 0..3 arrays with every 2 X 2 subblock sum greater than 6.at n=0A184211