9166
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
- 4
- Divisor Sum
- 13752
- Proper Divisor Sum (Aliquot Sum)
- 4586
- 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
- 4582
- Möbius Function
- 1
- Radical
- 9166
- 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
- 91
- Smith Number
- yes
- 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
- yes
- Odd
- no
Appears in sequences
- Number of protruded partitions of n with largest part at most 5.at n=14A005406
- 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 94.at n=26A031592
- Number of rooted trees with leaves of 2 colors where any 2 subtrees extending from the same node have a different number of nodes.at n=11A032306
- Expansion of sum ( q^n / product( 1-q^k, k=1..3*n), n=0..inf ).at n=28A035295
- Least positive integer not representable using exactly n 9's and the operations +-*/().at n=13A066409
- n times the coefficient of x^n in log[1 + sum(k>=0, x^2^k)].at n=47A092462
- 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, 1), (-1, 0, 1), (-1, 1, 0), (1, 0, -1), (1, 0, 0)}.at n=9A148634
- Number of walks within N^2 (the first quadrant of Z^2) starting at (0,0), ending on the vertical axis and consisting of 2 n steps taken from {(-1, 0), (-1, 1), (1, -1), (1, 0), (1, 1)}.at n=4A151453
- Numbers n with property that n^2 is a sum of some 70 successive primes.at n=12A166256
- G.f.: A(x) = 1/(1 - 2*x - 7*x^2 - 2*x^3 + x^4).at n=7A166989
- Third entry in row n of triangle in A169945.at n=19A169947
- Number of n element 0..2 arrays with each element the minimum of 7 adjacent elements of a random 0..2 array of n+6 elements.at n=14A217882
- Number of ways to write n as an ordered sum of 6 prime power palindromes (A084092).at n=45A282845
- G.f. A(x) satisfies: A(x) = 1 + x * A(x/(1 - x)^4) / (1 - x)^4.at n=6A351817
- Number of integer partitions of n of length > 2 whose second differences have median 0.at n=34A360682
- G.f. satisfies A(x) = ( 1 + x*A(x)^(5/2) / (1 - x) )^2.at n=5A371583
- Square array A(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where column k is the expansion of B(x)^k, where B(x) is the g.f. of A162661.at n=61A384651