17460
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
- 1
Divisibility
- Divisor Count
- 36
- Divisor Sum
- 53508
- Proper Divisor Sum (Aliquot Sum)
- 36048
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4608
- Möbius Function
- 0
- Radical
- 2910
- 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
- no
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 48
- 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
- a(n) = a(n-1) + 2*a(n-2) - a(n-3), with a(0) = a(1) = 0, a(2) = 1.at n=19A006053
- From George Gilbert's marks problem: jumping 7 marks at a time (initial positions).at n=23A019997
- Expansion of Product_{m>=1} (1+m*q^m)^(-30).at n=4A022722
- Numbers whose set of base-16 digits is {3,4}.at n=27A032840
- Denominators of continued fraction convergents to sqrt(726).at n=7A042399
- Number of nonempty subsets of {1,2,...,n} in which exactly 4/5 of the elements are <= (n-2)/3.at n=33A048024
- Number of nonempty subsets of {1,2,...,n} in which exactly 4/5 of the elements are <= (n-3)/3.at n=33A048035
- Numbers k that, when expressed in base 4 and then interpreted in base 8, give a multiple of k.at n=50A062923
- Long leg of primitive Pythagorean triangles having legs that add up to a square, sorted on hypotenuse.at n=17A089548
- Number of (s(0), s(1), ..., s(2n+1)) such that 0 < s(i) < 7 and |s(i) - s(i-1)| = 1 for i = 1,2,...,2n+1, s(0) = 1, s(2n+1) = 4.at n=8A094789
- Number of partitions that are "2-close" to being self-conjugate.at n=50A108961
- 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, 0), (0, 1), (1, -1)}.at n=14A151378
- Let i be in {1,2,3} and let r >= 0 be an integer. Let p = {p_1, p_2, p_3} = {-2,0,1}, n=2*r+p_i, and define a(-2)=1. Then, a(n)=a(2*r+p_i) gives the quantity of H_(7,1,0) tiles in a subdivided H_(7,i,r) tile after linear scaling by the factor x^r, where x=sqrt(2*cos(Pi/7)).at n=39A187065
- Let i be in {1,2,3} and let r >= 0 be an integer. Let p = {p_1, p_2, p_3} = {-2,0,1}, n=2*r+p_i, and define a(-2)=0. Then, a(n)=a(2*r+p_i) gives the quantity of H_(7,2,0) tiles in a subdivided H_(7,i,r) tile after linear scaling by the factor x^r, where x=sqrt(2*cos(Pi/7)).at n=37A187066
- Let i be in {1,2,3} and let r >= 0 be an integer. Let p = {p_1, p_2, p_3} = {-2,0,1}, n = 2*r + p_i and define a(-2)=0. Then, a(n) = a(2*r + p_i) gives the quantity of H_(7,3,0) tiles in a subdivided H_(7,i,r) tile after linear scaling by the factor x^r, where x = sqrt(2*cos(Pi/7)).at n=36A187067
- Number of n X 3 0..1 arrays avoiding 0 0 0 horizontally and 1 1 1 vertically.at n=5A206989
- Number of nX6 0..1 arrays avoiding 0 0 0 horizontally and 1 1 1 vertically.at n=2A206992
- T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 0 horizontally and 1 1 1 vertically.at n=30A206994
- T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 0 horizontally and 1 1 1 vertically.at n=33A206994
- Number of n X 2 0..2 arrays x(i,j) with each element horizontally or vertically next to at least one element with value (x(i,j)+1) mod 3, and upper left element zero.at n=9A230269