9275
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 13392
- Proper Divisor Sum (Aliquot Sum)
- 4117
- 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
- 6240
- Möbius Function
- 0
- Radical
- 1855
- 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
- 153
- 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
- a(n) = floor(C(n,4)/5).at n=34A011795
- Number of series-reduced dyslexic planted planar trees with n leaves.at n=9A032132
- a(n) = T(n,5), array T as in A051168; a count of Lyndon words; aperiodic necklaces with 5 black beads and n-5 white beads.at n=30A051170
- Number of compositions (ordered partitions) of n such that some part is repeated consecutively 6 times and no part is repeated consecutively more than 6 times.at n=13A091620
- Triangle T(n,k), read by rows, formed by setting all entries in the zeroth column and in the main diagonal ((n,n) entries) to 1 and defining the rest of the entries by the recursion T(n,k) = T(n-1,k) - T(n,k-1).at n=74A096470
- Numbers n such that n^2-6 and n^2+6 are both prime.at n=37A108403
- Number of odd-length branches starting at the root in all ordered trees with n edges.at n=9A127540
- a(0) = a(1) = 1. a(n) = a(n-1) + a(n - b(n)), where b(n) is largest prime dividing n.at n=34A137809
- Sums of rows of the triangle in A140740.at n=13A140741
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, 0), (1, 0, 1), (1, 1, -1)}.at n=9A148788
- Number of ways to place zero or more nonadjacent 1,1 2,1 3,0 3,1 4,2 4,3 polyhexes in any orientation on a planar nXnXn triangular grid.at n=6A155286
- Triangle read by rows: T(n,k) is the number of permutations of [n] starting with 1, having no 3-sequences and having k successions (0 <= k <= floor(n/2)); a succession of a permutation p is a position i such that p(i +1) - p(i) = 1.at n=33A180186
- Triangle read by rows: T(n,k) is the number of permutations of [n] starting with 1, having no 3-sequences and having k successions (0 <= k <= floor(n/2)); a succession of a permutation p is a position i such that p(i +1) - p(i) = 1.at n=40A180186
- The Wiener index of the binary Fibonacci tree of order n.at n=6A192019
- Triangular array: the fission of (p(n,x)) by (q(n,x)), where p(n,x)=sum{F(k+1)*x^(n-k) : 0<=k<=n}, where F=A000045 (Fibonacci numbers) and q(n,x)=(x+1)^n.at n=48A193997
- Mirror of the triangle A193997.at n=51A193998
- Number of 0..n arrays x(0..8) of 9 elements with zero 5th differences.at n=25A200332
- The greater of the lexicographically least pair (x, y) such that 0 < x < y and sigma(x) = sigma(y) = n + x + y.at n=37A285890
- Numbers k such that A090086(k), the smallest pseudoprime to base k (not necessarily exceeding k), is a Carmichael number.at n=13A293203
- 1/4 of the even edge of least 2-adic valuation of a primitive 3-simplex (0, b=A031173, c=A031174, d=A031175).at n=40A298046