10966
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 16452
- Proper Divisor Sum (Aliquot Sum)
- 5486
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5482
- Möbius Function
- 1
- Radical
- 10966
- 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
- 117
- 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
- a(n) = floor( n*(n-1)*(n-2)/5 ).at n=39A011887
- a(n) = least m such that if r and s in {1/1, 1/3, 1/5, ..., 1/(2n-1)} satisfy r < s, then r < k/m < (k+2)/m < s for some integer k.at n=45A024841
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 76 ones.at n=5A031844
- Number of necklaces with 6 black beads and n-6 white beads.at n=21A032191
- a(n) = floor(Pi^n / e).at n=9A032637
- Molien series for 3-D group X1.at n=21A037240
- Let f(n) be 2n + POD(n) + 1 if n is even, otherwise 2n - POD(n) - 1, where POD(n) is the product of digits of n. Sequence gives smallest number requiring n iterations to reach a prime.at n=49A074808
- a(n) = n + Fibonacci(n+1).at n=20A081659
- Numerator of Sum[ Prime[k]^2, {k,1,n}] / Product[ Prime[k], {k,1,n}] = Numerator[ A024450[n] / A002110[n] ].at n=24A122136
- a(n) = (n^4 + 46*n^3 - 169*n^2 + 146*n + 24)/24.at n=15A143059
- Number of planar n X n X n binary triangular grids symmetric under 120 degree rotation with every one adjacent to exactly 1 other one.at n=12A153982
- Triangle T(n, k, m) = (m*(n-k) + 1)*T(n-1, k-1, m) + (m*k + 1)*T(n-1, k, m) - m*k*(n-k)*T(n-2, k-1, m) with T(n, 0, m) = T(n, n, m) = 1 and m = 1, read by rows.at n=47A157152
- Triangle T(n, k, m) = (m*(n-k) + 1)*T(n-1, k-1, m) + (m*k + 1)*T(n-1, k, m) - m*k*(n-k)*T(n-2, k-1, m) with T(n, 0, m) = T(n, n, m) = 1 and m = 1, read by rows.at n=52A157152
- Triangle T(n,k), 0<=k<=n, read by rows given by [1,1,2,1,2,1,2,1,2,1,2,...] DELTA [1,1,0,0,0,0,0,0,0,...] where DELTA is the operator defined in A084938.at n=30A167656
- Number of nondecreasing arrangements of n numbers in -8..8 with sum zero and sum of squares not greater than n*72/3.at n=7A183926
- Semiprime centered triangular numbers.at n=31A184481
- Number of projective reflection products on a set with n elements.at n=7A191016
- Number of partitions p of n such that the number of numbers having multiplicity 1 in p is a part of p.at n=36A241413
- Number of subsets of [n] whose sum is a triangular number.at n=17A284250
- a(n) = s(n,n) + s(n,n-1) + s(n,n-2), where s(n,k) are the unsigned Stirling numbers of the first kind (see A132393).at n=17A308305