8970
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 32
- Divisor Sum
- 24192
- Proper Divisor Sum (Aliquot Sum)
- 15222
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2112
- Möbius Function
- -1
- Radical
- 8970
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 5
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
- 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
- Boustrophedon transform of partition numbers 1, 1, 1, 2, 3, 5, 7, ...at n=8A000733
- Number of nonequivalent dissections of an n-gon into 3 polygons by nonintersecting diagonals rooted at a cell up to rotation and reflection.at n=38A003452
- Areas of right triangles with coprime integer sides.at n=40A024365
- Ordered areas of primitive Pythagorean triangles.at n=43A024406
- Base-8 palindromes that start with 2.at n=30A043022
- Products of exactly 5 distinct primes.at n=18A046387
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2*n - 3 - 2^(p+1) and p is the unique value such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = a(2) = 1 and a(3) = 3.at n=41A050032
- a(n) = a(n-1) + a(m) for n >= 3, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1 and a(2) = 2.at n=41A050048
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1 and a(2) = a(3) = 3.at n=41A050064
- Numbers that are divisible by exactly 5 different primes.at n=25A051270
- The number phi_2(n) of Frobenius partitions that allow up to 2 repetitions of an integer in a row.at n=24A053993
- 4n^2+1, 2n^2+1, 2n^2-1 are all prime.at n=21A055755
- Numbers k such that 2^k + 7 is prime.at n=33A057195
- a(n) = a*b = x*y with (a-b) = (x+y) = A020882(n) (a>b, a>0, b>0, x>0, y>0), gcd(a, b) = gcd(x, y) = 1.at n=42A057229
- Integers which have at least two different factorizations into coprime parts whose sum are equal.at n=36A069064
- Numbers n such that sum of distinct primes dividing n is divisible by the largest prime dividing n. Also n is neither a prime, nor a true power of prime and n is squarefree. Squarefree solutions of A071140.at n=11A071141
- Numbers n such that sum of distinct primes dividing n is divisible by the largest prime dividing n. Also n has exactly 5 distinct prime factors and n is squarefree.at n=1A071144
- Squarefree numbers k such that the largest prime factor of k is equal to the sum of the other prime factors of k.at n=11A071312
- a(n) = rad(n*(n+1)*(n+2)*(n+3)).at n=22A078638
- Least area of primitive Pythagorean triangle whose legs differ by A058529(n).at n=21A094143