8675
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 26
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 10788
- Proper Divisor Sum (Aliquot Sum)
- 2113
- 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
- 6920
- Möbius Function
- 0
- Radical
- 1735
- Omega Function (Ω)
- 3
- 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
- 47
- 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
- no
- Odd
- yes
Appears in sequences
- Number of partitions in expanding space.at n=6A023879
- a(n) = 2*a(n-1) + a(floor(n/2)), with a(1) = 1, a(2) = 2.at n=12A033490
- Number of digraphs with a source and a sink on n unlabeled nodes.at n=4A049531
- Consider the Diophantine equation x^3 + y^3 = z^3 - 1 (x < y < z) or 'Fermat near misses'. The values of z (see A050787) are arranged in monotonically increasing order. Sequence gives values of y.at n=15A050789
- a(n)=A074639(A074647(n)).at n=33A074648
- Iccanobirt numbers (15 of 15): a(n) = R(R(a(n-1)) + R(a(n-2)) + R(a(n-3))), where R is the digit reversal function A004086.at n=17A102125
- Numbers k such that k and k^2 use only the digits 2, 5, 6, 7 and 8.at n=22A137111
- Number of n X n arrays of squares of integers with every (n-1) X (n-1) subblock summing to 5 and every element equal to at least one neighbor.at n=3A146125
- a(n) = n*(14*n-3).at n=25A185019
- Total number of positive integers below 10^n requiring 9 positive biquadrates in their representation as sum of biquadrates.at n=4A186663
- Number of (w,x,y,z) with all terms in {1,...,n} and w+x<2y+2z.at n=10A212562
- Reversals of tribonacci numbers (sorted).at n=17A215649
- Products of 3 evil primes (A027699) p,q,r, such that numbers p*q, p*r, q*r, and p*q*r are odious (A000069).at n=8A230353
- Total number of sequences with c_j copies of j and longest increasing subsequence of length k summed over all compositions [c_1, c_2, ..., c_k] of n into distinct parts.at n=9A268701
- Odd numbers k such that phi(k) and cototient(k) have the same prime signature.at n=11A280927
- Lexicographically first sequence of distinct terms such that any set of three successive digits can be reordered as {d, d+1, d+2}, d being the smallest of the three digits.at n=50A302173
- Number of integer partitions of n with no two distinct consecutive parts divisible.at n=45A328675
- G.f. satisfies A(x) = 1 + x*A(x)^3 + x^2*A(x)^8.at n=6A364478
- Number of non-similar triangles possible with distinct positive integer side lengths of at most n units.at n=50A373051