10871
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 12432
- Proper Divisor Sum (Aliquot Sum)
- 1561
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9312
- Möbius Function
- 1
- Radical
- 10871
- 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
- no
- 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
- no
- Odd
- yes
Appears in sequences
- a(n) is the number of conjugacy classes in the alternating group A_n.at n=36A000702
- Number of minimal covers of an n-set that have exactly one point which appears in more than one set in the cover.at n=5A003466
- [ Sum{(sqrt(j+1)-sqrt(i+1))^3} ], 1 <= i < j <= n.at n=40A025223
- Triangle of a(n,k) = number of minimal covers of an n-set that cover k points of that set uniquely (n >= 1, k >= 1).at n=26A035347
- Number of partitions of n into parts not of the form 21k, 21k+8 or 21k-8. Also number of partitions with at most 7 parts of size 1 and differences between parts at distance 9 are greater than 1.at n=34A035986
- Record entries in A065191.at n=46A065192
- Partial sums of primes that are not Chen primes (starting with 1).at n=34A118483
- Abs(square of n-th prime minus cube of n-1).at n=30A151911
- Numbers n such that 30n+{11, 13, 17, 19, 23} are 5 consecutive primes.at n=17A182279
- Number of n X 3 binary arrays without the pattern 0 0 1 antidiagonally or horizontally.at n=4A188986
- T(n,k)=Number of nXk binary arrays without the pattern 0 0 1 antidiagonally or horizontally.at n=25A188992
- Number of 5Xn binary arrays without the pattern 0 0 1 antidiagonally or horizontally.at n=2A188995
- a(n) = A005291(n) + A005291(n+1).at n=31A195308
- Nonprimes such that it takes exactly 3 iterations of reverse-and-add digits to generate a prime.at n=16A245208
- Number T(n,k) of permutations p of [n] such that the up-down signature of 0,p has nonnegative partial sums with a maximal value of k; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=38A258829
- Column 2 of triangle A258829.at n=6A259213
- Triangular array read by rows. T(n,k) is the number of minimal covers of an n-set with exactly k points that are in more than one set of the cover, n>=0, 0<=k<=max(0,n-2).at n=18A282575
- Record high points in A336957.at n=47A337646
- Fixed points in A375564.at n=23A376584