8656
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 10
- Divisor Sum
- 16802
- Proper Divisor Sum (Aliquot Sum)
- 8146
- 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
- 4320
- Möbius Function
- 0
- Radical
- 1082
- Omega Function (Ω)
- 5
- 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
- yes
- Odd
- no
Appears in sequences
- Shifts left when inverse Moebius transform applied twice.at n=42A007557
- Numbers k such that the continued fraction for sqrt(k) has period 74.at n=24A020413
- a(0)=2; a(n) is the smallest k > a(n-1) such that the fractional part of k^(1/11) starts with n.at n=28A034076
- Minimum sum of n distinct positive numbers, any n-1 of which sum to a square.at n=9A035305
- Numbers having three 7's in base 9.at n=34A043483
- a(n) = Sum_{k=0..floor(n/4)} C(n-3*k,k+1).at n=27A098578
- Number of irregular primes less than or equal to the m-th prime, where m = floor(exp(n)).at n=9A105466
- From the game of Quod: number of "squares" on an n X n array of points with the four corner points deleted.at n=16A124479
- Number of walks within N^2 (the first quadrant of Z^2) starting at (0,0), ending on the vertical axis and consisting of n steps taken from {(-1, -1), (-1, 1), (0, -1), (1, 1)}.at n=10A151389
- Partial sums of A160414.at n=20A161325
- Number of (w,x,y) with all terms in {0,...,n} and w != x and x > range(w,x,y).at n=25A212969
- 6^n mod 10000.at n=30A216128
- Binomial convolution of the numbers in sequence A080253.at n=4A217486
- E.g.f. satisfies: A'(x) = A(x)^6 * A(-x)^2 with A(0) = 1.at n=5A235372
- Number of nX4 0..3 arrays with no element equal to zero plus the sum of elements to its left or one plus the sum of elements above it or two plus the sum of the elements diagonally to its northwest, modulo 4.at n=4A240391
- T(n,k)=Number of nXk 0..3 arrays with no element equal to zero plus the sum of elements to its left or one plus the sum of the elements above it or two plus the sum of the elements diagonally to its northwest, modulo 4.at n=32A240394
- Number of 5 X n 0..3 arrays with no element equal to zero plus the sum of elements to its left or one plus the sum of the elements above it or two plus the sum of the elements diagonally to its northwest, modulo 4.at n=3A240397
- Number T(n,k) of tilings of a 5 X n rectangle with pentominoes of any shape and exactly k pentominoes of shape V; triangle T(n,k), n>=0, 0<=k<=max(0,n-2+delta_{n,3}), read by rows.at n=14A247709
- Nonnegative integers n such that in balanced ternary representation the number of occurrences of each trit doubles when n is squared.at n=24A257867
- E.g.f.: Series_Reversion( 5*x - 4*x*exp(x) ).at n=3A259065