8706
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 17424
- Proper Divisor Sum (Aliquot Sum)
- 8718
- 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
- 2900
- Möbius Function
- -1
- Radical
- 8706
- Omega Function (Ω)
- 3
- 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
- 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 n-node rooted trees of height 8.at n=14A000429
- Diagonals of Pascal's triangle mod 2 interpreted as binary numbers.at n=27A006921
- Numbers k such that phi(k) | sigma_14(k).at n=19A015773
- Numbers k such that the continued fraction for sqrt(k) has period 62.at n=36A020401
- Let c(k) denote the k-th composite number and p(k) the k-th prime number; then a(n) = Sum_{i=n*(n-1)/2+1 .. n*(n+1)/2} c(i) - Sum_{i=1..n} p(i).at n=24A024850
- 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 92.at n=19A031590
- Numbers whose base-4 representation contains exactly four 0's and three 2's.at n=6A045060
- Number of positive integers <= 2^n of form x^2 + 19 y^2.at n=16A054232
- Numbers k such that (3^k - 7)/2 is prime.at n=11A063679
- Triangle, read by rows, where the n-th row lists the coefficients of the polynomial of degree n, with root -1, that generates the n-th diagonal of this sequence.at n=47A091173
- Indices of primes in sequence defined by A(0) = 71, A(n) = 10*A(n-1) + 31 for n > 0.at n=11A101139
- Lesser of twin admirable numbers: k such that k and k+2 are both admirable numbers.at n=33A109730
- a(n) = Sum_{k=0..floor(n/2)} 2^((n-2*k)*k) for n>=0.at n=10A117403
- Row sums of triangle A118185: a(n) = Sum_{k=0..n} 4^(k*(n-k)) for n>=0.at n=5A118186
- A106486-encodings of combinatorial games with value -1.at n=20A125993
- Expansion of g.f. (2*x^3 + 5) / ( -x^5 + x^3 + 1).at n=54A136598
- a(n) = prime(n^2) - n^2.at n=34A141129
- 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), (0, 1, -1), (1, 0, 1), (1, 1, 0)}.at n=7A150570
- Transform of the finite sequence (1, 0, -1, 0, 1) by the T_{0,0} transform (see link).at n=12A159348
- Numbers that are the sum of two reversed consecutive primes in more than one way.at n=19A162705