9175
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
- 3
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 11408
- Proper Divisor Sum (Aliquot Sum)
- 2233
- 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
- 7320
- Möbius Function
- 0
- Radical
- 1835
- 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
- 122
- 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
- Apply partial sum operator twice to Stern's sequence.at n=13A014172
- Numbers k such that the continued fraction for sqrt(k) has period 72.at n=37A020411
- Numbers k such that k^2 is formed from two subsquares that overlap in a single digit.at n=8A048422
- Combinatorial triangle !n. This table read by rows gives the coefficients of general sum formulas of n-th left factorials (A003422). The k-th row (k>=1) contains T(i,k) for i=1 to 2*k and k=1 to n-2, where T(i,k) satisfies !n = n + Sum_{k=1..n-2} Sum_{i=1..2*k} T(i,k) * C(n-k-1,i).at n=22A102639
- Start with 1057 and repeatedly reverse the digits and add 2 to get the next term.at n=18A120215
- Conjectured smallest Sierpiński numbers of the second kind S, base b=2,3,4,5,..., where S*b^n+1 is composite for all n>=1 and gcd(S+1, b-1) = 1.at n=8A123159
- Composite numbers such that exactly ten distinct permutations of digits are prime.at n=31A163562
- Expansion of x/(1-9*x-11*x^2+10*x^3).at n=4A164913
- Integers of the form 4n+3 for which Sum_{i=1..u} J(i,4n+3) obtains value zero exactly 9 times, when u ranges from 1 to (4n+3). Here J(i,k) is the Jacobi symbol.at n=26A166059
- Expansion of e.g.f.: 1/(1-tan(sin(x))).at n=7A190123
- Number of nX2 0..3 arrays with values 0..3 introduced in row major order, the number of instances of each value within one of each other, and every element equal to zero or one horizontal or vertical neighbors.at n=5A199351
- Number of nX6 0..3 arrays with values 0..3 introduced in row major order, the number of instances of each value within one of each other, and every element equal to zero or one horizontal or vertical neighbors.at n=1A199355
- T(n,k)=Number of nXk 0..3 arrays with values 0..3 introduced in row major order, the number of instances of each value within one of each other, and every element equal to zero or one horizontal or vertical neighbors.at n=22A199356
- T(n,k)=Number of nXk 0..3 arrays with values 0..3 introduced in row major order, the number of instances of each value within one of each other, and every element equal to zero or one horizontal or vertical neighbors.at n=26A199356
- Numbers that end in (..., 175, 175, 175, ...) under the rule: next term = product of the last four digits in the sequence so far.at n=46A239721
- Integers n not of form 3m+2 such that for any integer k > 0, n*10^k+1 has a divisor in the set { 7, 11, 13, 37 }.at n=0A243969
- Numbers n such that 4n + 1, 4n + 2 and 4n + 3 are not squarefree.at n=18A258332
- Number of maximal matchings in the n-web graph.at n=8A287497
- Numbers n such that n^3 contains the consecutive substring 2,3,5,7.at n=8A295900
- Number of nX5 0..1 arrays with every element unequal to 0, 1, 2 or 3 king-move adjacent elements, with upper left element zero.at n=11A303724