8708
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
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 17472
- Proper Divisor Sum (Aliquot Sum)
- 8764
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 3720
- Möbius Function
- 0
- Radical
- 4354
- 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
- 140
- 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
- yes
- Odd
- no
Appears in sequences
- Number of partitions in parts not of the form 11k, 11k+3 or 11k-3. Also number of partitions with at most 2 parts of size 1 and differences between parts at distance 4 are greater than 1.at n=39A035946
- a(n) = floor(47*(n-3/2)^(3/2)).at n=32A050256
- Non-palindromic number and its reversal are both multiples of 14.at n=33A062913
- Records for terms in the continued fraction of Catalan's constant.at n=8A099789
- Coefficients of the A-Rogers mod 14 identity.at n=36A105780
- Triangle, read by rows, where row n equals the inverse binomial transform of the crystal ball sequence for D_n lattice.at n=31A108556
- 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), (-1, 1, 1), (0, 0, -1), (1, 0, 0)}.at n=9A148639
- T(n,m) = number of 0..m-1 integer arrays v[1..n] of length n with all autocorrelation values sum(i){v[i]*v[i-k]} distinct for k in 0..n-1.at n=50A171307
- Number of 0..4 integer arrays v[1..n] of length n with all autocorrelation values sum(i){v[i]*v[i-k]} distinct for k in 0..n-1.at n=5A171310
- Number of 0..n-1 integer arrays v[1..6] of length 6 with all autocorrelation values sum(i){v[i]*v[i-k]} distinct for k in 0..5.at n=4A171357
- y-values in the solution to 17*x^2 + 16 = y^2.at n=6A199798
- Triangle of coefficients of polynomials v(n,x) jointly generated with A208765; see the Formula section.at n=42A208766
- Triangle of coefficients of polynomials v(n,x) jointly generated with A208919; see the Formula section.at n=41A208920
- Inversion sets of finite permutations that have only 0's and 1's in their inversion vectors.at n=26A211364
- Conjectured number of digits in highest power of n with no four consecutive identical digits.at n=10A216142
- Number of ON cells in the even-rule cellular automaton after n steps with the Moore neighborhood (8 neighbors), with minimal nontrivial symmetric initial state (0,0), (0,1), (1,0), and (1,1) ON.at n=98A254731
- T(n,k) = Number of n X k arrays containing k copies of 0..n-1 with no equal horizontal, vertical, diagonal or antidiagonal neighbors and new values introduced sequentially from 0.at n=32A265421
- Number of 5Xn arrays containing n copies of 0..5-1 with no equal horizontal, vertical, diagonal or antidiagonal neighbors and new values introduced sequentially from 0.at n=3A265422
- Numbers n such that Bernoulli number B_{n} has denominator 870.at n=23A272185
- Numbers m such that there exists at least one integer k < m such that m^2+1 and k^2+1 have the same prime factors.at n=12A282092