9265
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
- 8
- Divisor Sum
- 11880
- Proper Divisor Sum (Aliquot Sum)
- 2615
- 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
- 6912
- Möbius Function
- -1
- Radical
- 9265
- Omega Function (Ω)
- 3
- 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
- 109
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- Number of paraffins.at n=32A005997
- Define the sequence S(a_0,a_1) by a_{n+2} is the least integer such that a_{n+2}/a_{n+1}>a_{n+1}/a_n for n >= 0. This is S(4,8).at n=10A019479
- Pseudoprimes to base 33.at n=30A020161
- Pseudoprimes to base 63.at n=27A020191
- Numbers k such that the continued fraction for sqrt(k) has period 31.at n=33A020370
- a(n) = n*(2*n^2 - 2*n + 1).at n=17A059722
- Number of polyhexes with n cells that tile the plane by translation or by 180-degree rotation (Conway criterion).at n=9A075212
- a(n) = smallest multiple of prime(n) such that a(n) +1 is a multiple of prime(n+1).at n=28A077338
- Difference between A007678(2n)/(2n) and (n-1)^2.at n=32A085611
- Triangular array, read by rows: T(n,k) = greatest decimal number of length k contained as a string in the first n positions of the decimal expansion of Pi, 1 <= k <= n.at n=39A086667
- a(n) = Sum_{i=1..n} 2^(b(i) - 1), where b(n) is the differences between consecutive primes.at n=36A086769
- Greater of a,b where n^2 = a^3 + b^3; a,b>0 and gcd(a,b)=1. The lesser of a,b is the corresponding term in A099532 and n, which is used to order this sequence, is the corresponding term in A099426.at n=25A099533
- a(n) = ceiling(n/2)*ceiling(n^2/2).at n=33A131474
- Values of hypotenuse of primitive Pythagorean triples which can have four different shapes (that is, four different sets of "legs").at n=31A159781
- A triangle sequence of the form:q=3:t(n,m,q)=Sum[q^i*Floor[Eulerian[n + 1, m]/2^i], {i, 0, 10}].at n=29A174040
- A triangle sequence of the form:q=3:t(n,m,q)=Sum[q^i*Floor[Eulerian[n + 1, m]/2^i], {i, 0, 10}].at n=34A174040
- Number of 10-element subsets of {1, 2, ..., n} having pairwise coprime elements.at n=14A186986
- Number of (n+3) X 8 binary arrays with every 4 X 4 subblock commuting with each horizontal and vertical neighbor 4 X 4 subblock.at n=7A188101
- Number of (n+3)X11 binary arrays with every 4X4 subblock commuting with each horizontal and vertical neighbor 4X4 subblock.at n=4A188104
- a(n) = 16*n^2 + 2*n + 1.at n=24A204675