17226
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 32
- Divisor Sum
- 43200
- Proper Divisor Sum (Aliquot Sum)
- 25974
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5040
- Möbius Function
- 0
- Radical
- 1914
- Omega Function (Ω)
- 6
- 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
- yes
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 79
- 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
- Expansion of Product_{k>=1} (1 - x^k)^12.at n=20A000735
- Ceiling of Gamma(n+5/7)/Gamma(5/7).at n=8A020120
- a(n) = 1*t(n) + 2*t(n-1) + ...+ k*t(n+1-k), where k=floor((n+1)/2) and t is A001950 (upper Wythoff sequence).at n=41A023867
- s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (natural numbers), t = A001950 (upper Wythoff sequence).at n=40A024864
- Even 10-gonal (or decagonal) numbers.at n=33A028994
- Numbers k such that 4^k - 3 is prime.at n=29A059266
- Sum of squares of entries of Wilkinson's eigenvalue test matrix of order 2n+1.at n=29A059834
- a(n) = (2*n^3 - n^2 - n + 2)/2.at n=26A081441
- Triangular matrix T, read by rows, where row n equals row (n-1) of T^(n-1) after appending '1' for the main diagonal.at n=60A101479
- a(n) = n*(n+1)*(n+7)*(122+57*n+n^2)/120.at n=10A101862
- 10-gonal numbers which are divisible by the sum of their digits.at n=24A119548
- Triangular matrix T, read by rows, where row n of T equals row (n-1) of T^(n+1) with an appended '1'.at n=39A121412
- Column 3 of triangle A121412, in which row n of T=A121412 equals row (n-1) of T^(n+1) with an appended '1'.at n=5A121415
- Number of subpartitions of partition P=[0,0,0,0,1,1,1,1,1,2,2,2,2,2,2,3,...], where P(n) = [(sqrt(8*n+49) - 7)/2].at n=30A121433
- Define an array by d(m, 0) = 1, d(m, 1) = m; d(m, k) = (m - k + 1) d(m+1, k-1) - (k-1) (m+1) d(m+2, k-2). Sequence gives d(n,3).at n=27A126935
- Numbers which divide their digital sumorial (see A131383).at n=6A135100
- Number of n X n arrays of squares of integers with every (n-1)X(n-1) subblock summing to 13 and every element equal to at least one neighbor.at n=2A146497
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 1), (-1, 1, 0), (0, -1, 1), (0, 0, 1), (1, 1, -1)}.at n=9A148488
- Number of 3-step self-avoiding walks on an n X n X n cube summed over all starting positions.at n=8A187164
- Expansion of f(x)^12 in powers of x where f() is a Ramanujan theta function.at n=20A209676