9163
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 12312
- Proper Divisor Sum (Aliquot Sum)
- 3149
- 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
- 6720
- Möbius Function
- 0
- Radical
- 1309
- 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
- no
- Odd
- yes
Appears in sequences
- [ sqrt(3/2)^n ].at n=45A014215
- a(n) = T(3n,n), where T is the array in A026300.at n=5A026303
- Composite numbers whose prime factors contain no digits other than 1 and 7.at n=30A036307
- Let m = 3, 5, 7, ..., k = 0, 1, 2, 3, ..., z = (m+1)/2, 0 < j <= m. Let n_j be a prime number. Sequence gives T(m,k) = Table[m,k] = number of solutions to Sum_{d=1,2, ..., (z+k)}(n_j)_d = Sum_{d=1,2, ..., (z-k-1)}(n_j)_d = primorial number (A002110).at n=55A057611
- a(n) = floor(sqrt(Fibonacci(n+1)) - sqrt(Fibonacci(n))).at n=45A063595
- Take pairs (x,y) with Sum_{j = x..y} j = concatenation of x and y. Sort pairs on y then x. This sequence gives y of each pair.at n=20A070153
- a(n) = round(10000*log(n/10)).at n=24A104077
- a(n) = 2^[n(n+1) - A000120(n)] * [x^n] 1/(1-x)^(1/2^n) for n>=0, where A000120(n) = number of 1's in binary expansion of n.at n=4A134097
- Numbers of the form 12n+7 for which Sum_{i=0..(4n+2)} J(i,12n+7) = 0, where J(i,m) is the Jacobi symbol.at n=25A165463
- Molecular topological indices of the gear graphs.at n=16A192827
- Number of (w,x,y,z) with all terms in {1,...,n} and w*x-y*z<n.at n=11A212108
- Numbers k such that 3*R_(k+2) - 2*10^k is prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=19A256326
- Expansion of Product_{k>=1} 1/((1-x^(3*k-1))*(1-x^(3*k-2)))^k.at n=27A262883
- Where the zeros in A123066 occur.at n=40A321962
- Number of compositions of n that are either strictly increasing or strictly decreasing.at n=52A333147
- a(n) is the sum of all products of pairs of numbers joined by the diagonals of an n-gon when its vertices are numbered from 1 to n in order.at n=16A337130
- Number of 3-row-restricted Baxter slicings of size n.at n=8A342289
- G.f. satisfies 1 = Sum_{n>=0} x^n * (1 + x*A(x)^n)^n / A(x)^(n+1).at n=11A385913
- Primitive terms of A389634.at n=23A389635