8607
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
- 12160
- Proper Divisor Sum (Aliquot Sum)
- 3553
- 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
- 5400
- Möbius Function
- -1
- Radical
- 8607
- 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
- 171
- 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
- no
- Odd
- yes
Appears in sequences
- [ (3rd elementary symmetric function of 3,4,...,n+4)/(3+4+...+n+4) ].at n=17A024191
- a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n-k+1), where k = floor(n/2), s = natural numbers, t = odd natural numbers.at n=35A024862
- a(n) = Sum_{k=1..floor(n/2)} T(n, 2k), array T as in A049777.at n=35A049779
- Number of base-2 strong pseudoprimes (A001262) less than 10^n.at n=10A055552
- Numbers k such that k and its reversal are both multiples of 19.at n=27A062907
- Non-palindromic number and its reversal are both multiples of 19.at n=18A062916
- a(n)=A089551(n)/2.at n=41A089558
- G.f. satisfies A(x) = 1+x + x^2*A(x)^6.at n=8A137966
- A linear combination of A008292 and A130595: t(n,m)=2*A008292(n,m)- A130595(n,m).at n=33A141903
- Conjectured number of digits in highest power of n with no four consecutive identical digits.at n=40A216142
- a(n) = (A216363(n) - 1)/118.at n=14A216380
- Least numbers k for each base b >= 2 such that N = b^(2^n) + k is prime for 6 consecutive values from n = 0 to n = 5.at n=20A225492
- Total number of torsion-free congruence subgroups of PSL(2,Z) of genus n.at n=16A258696
- Let f(x) be the absolute value of the difference between x and its base-2 reversal. Let g(x) be the number of times f(x) must be applied to x for the result to be 0. a(n) is the smallest value of x for which g(x) is n.at n=9A259658
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 294", based on the 5-celled von Neumann neighborhood.at n=36A271134
- Trajectory of n under the Reverse and Add! operation carried out in base 8 (presumably) does not reach a palindrome and (presumably) does not join the trajectory of any term m < n.at n=22A306596
- Number of odd parts in the partitions of n into 10 parts.at n=35A309660
- a(n) = ((n + 1) - 9*(n + 1)^2 + 8*(n + 1)^3)/6.at n=18A331987
- Numbers whose binary expansion generates rotationally symmetric XOR-triangles.at n=48A334556
- Numbers m that generate rotationally symmetrical XOR-triangles T(m) that have central triangles of zeros.at n=14A334769