17780
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 43008
- Proper Divisor Sum (Aliquot Sum)
- 25228
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6048
- Möbius Function
- 0
- Radical
- 8890
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 4
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
- 35
- 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
- dot_product(n,n-1,...2,1)*(7,8,...,n,1,2,3,4,5,6).at n=35A026066
- Decimal part of cube root of a(n) starts with 1: first term of runs.at n=24A034127
- Number of isomorphism classes of anti-associative closed binary operations on a set of order n.at n=4A079180
- Number of base 12 n-digit numbers with adjacent digits differing by three or less.at n=5A126480
- Triangle read by rows: matrix inverse of A154959.at n=32A154960
- a(n) = 3600*n^2 - 5599*n + 2177.at n=2A157842
- Triangle of coefficients of polynomials defined by Binet form: P(n,x) = ((x+d)^n + (x-d)^n)/2, where d=sqrt(x+4).at n=61A162516
- Partial sums of floor(n^3/3).at n=21A173707
- Numbers n such that d(1)^1 + d(2)^2 + ... + d(p)^p and d(1)^p + d(2)^p-1 +... + d(p)^1 are squares, where d(i), i=1..p, are the digits of n.at n=37A178360
- Number of -n..n arrays x(0..6) of 7 elements with zero sum and no two consecutive declines, no adjacent equal elements, and no element more than one greater than the previous (random base sawtooth pattern).at n=31A200185
- Number of nX3 0..1 arrays with rows and columns lexicographically nondecreasing and the instance counts of every value within one of each other.at n=14A201379
- Number of (n+2)X3 binary arrays avoiding patterns 000 and 011 in rows, columns and nw-to-se diagonals.at n=8A202770
- T(n,k) = Number of (n+2) X (k+2) binary arrays avoiding patterns 000 and 011 in rows, columns and nw-to-se diagonals.at n=36A202777
- Number of (w,x,y,z) with all terms in {0,...,n} and (least gapsize)=1.at n=15A212894
- Triangle of transformation semigroup sizes generated by a single element.at n=19A225725
- Numbers m such that the GCD of the x's that satisfy sigma(x) = m is 4.at n=16A241649
- Number of rectangular plane partitions of n with strictly decreasing rows and columns.at n=44A323430
- Number of compositions of n where every distinct subsequence (not necessarily contiguous) has a different sum.at n=39A334268
- Array read by falling antidiagonals: T(n,k) = numerator(Sum_{x>0} (x^n)/(k^x)); n >= 0 and k >= 2.at n=42A374895