8711
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 9024
- Proper Divisor Sum (Aliquot Sum)
- 313
- 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
- 8400
- Möbius Function
- 1
- Radical
- 8711
- 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
- 109
- 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
- Number of increasing sequences of addition chain type with maximal element n.at n=16A008928
- Composite numbers k such that k!/k# - 1 is prime, where k# = primorial numbers A034386.at n=22A049421
- Numerators in expansion of Euler transform of b(n) = 1/3.at n=6A061160
- a(n) = (2*n - 1)*(7*n^2 - 7*n + 6)/6.at n=15A063490
- Numbers n such that 2*p(n)+3, 2*p(n+1)+3, 2*p(n+2)+3 are consecutive primes, where p(i) denotes the i-th prime.at n=10A088066
- Odd numbers n for which 17 is the smallest i (>= 1) with Jacobi symbol J(i,n) getting either a value 0 or -1.at n=7A112077
- Numbers k such that k and k^2 use only the digits 1, 2, 5, 7 and 8.at n=9A137008
- Numbers k such that k!/k#-1 is prime, where k# is the primorial function (A034386).at n=27A140293
- a(n) = n*(9*n+2).at n=31A147296
- 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, 1, 0), (0, 0, 1), (1, 0, 1), (1, 1, -1)}.at n=7A150556
- a(n) = 18*n^2 - 1.at n=21A157910
- a(n) = 8*n^2 - 1.at n=32A157914
- a(n) = 242*n - 1.at n=35A157961
- a(n) = 484*n - 1.at n=17A158330
- a(n) = 72*n^2 - 1.at n=10A158738
- Number of partitions of n containing a clique of size 2.at n=33A183559
- Least odd number k such that x' = k has n solutions, where x' is the arithmetic derivative (A003415) of x.at n=23A189560
- Number of n-bead necklaces labeled with numbers 1..4 not allowing reversal, with no adjacent beads differing by more than 1.at n=11A208773
- Number of (n+1)X(3+1) 0..1 arrays with the sum of each 2X2 subblock two median terms lexicographically nondecreasing rowwise and columnwise.at n=2A235543
- T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with the sum of each 2X2 subblock two median terms lexicographically nondecreasing rowwise and columnwise.at n=12A235548