17200
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 30
- Divisor Sum
- 42284
- Proper Divisor Sum (Aliquot Sum)
- 25084
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6720
- Möbius Function
- 0
- Radical
- 430
- Omega Function (Ω)
- 7
- Little Omega Function (ω)
- 3
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
- 27
- 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
- Numbers k such that k^2 is palindromic in base 7.at n=42A029992
- Base-7 digits are, in order, the first n terms of the periodic sequence with initial period 1,0,1.at n=5A033125
- Sums of 4 distinct powers of 7.at n=7A038483
- Numbers whose base-7 representation contains exactly four 1's.at n=32A043400
- a(n) = binomial(n,0) - binomial(n,2) + binomial(n,4).at n=27A058923
- Keep only the middle digit of each integer and concatenate them. The result is the concatenation of all integers of the sequence.at n=47A106003
- a(n) = sum of n consecutive cubes after n^3.at n=7A116149
- a(n) = 1 + n^2 + n^3 + n^5.at n=6A123650
- a(n) = (n-1)*(n+4)*(n+6)/6 for n > 1, a(1)=1.at n=43A137742
- G.f. satisfies: A(x) = Sum_{n>=0} x^(n^2) * A(x)^(n^2).at n=14A157136
- a(n) = n*(2*n^2 + 5*n + 1)/2.at n=24A162254
- Triangle read by rows, A033184 * A091768 (diagonalized as an infinite lower triangular matrix).at n=43A163946
- Totally multiplicative sequence with a(p) = 9p-2 for prime p.at n=29A166672
- Number of 4-step knight's tours on an (n+2) X (n+2) board summed over all starting positions.at n=7A186853
- Let x(0)x(1)x(2)... x(q) denote the decimal expansion of n. Sequence lists the numbers n such that the suffix of decimal expansion x(2)... x(q) is the p-th divisor of n where p is the prefix of decimal expansion x(0)x(1).at n=7A234315
- Number of (n+1) X (n+1) 0..2 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 1 (constant-stress 1 X 1 tilings).at n=2A234435
- Number of (n+1) X (3+1) 0..2 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 1 (constant-stress 1 X 1 tilings).at n=2A234438
- T(n,k) is the number of (n+1) X (k+1) 0..2 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 1 (constant-stress 1 X 1 tilings).at n=12A234443
- Least k formed by the concatenation of two numbers n and d such that d is the n-th divisor of k, or 0 if no such k exists.at n=16A257491
- Numbers m such that the concatenation of k and the k-th divisor of m is equal to m for some k.at n=17A258738