17083
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 18648
- Proper Divisor Sum (Aliquot Sum)
- 1565
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 15520
- Möbius Function
- 1
- Radical
- 17083
- Omega Function (Ω)
- 2
- 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
- 79
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- Squarefree Number
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- Numbers that are the sum of 3 nonzero 6th powers.at n=25A003359
- Numbers that are the sum of at most 3 nonzero 6th powers.at n=44A004854
- These numbers take a record number of steps to reach the top of the deck in Guy's shuffle (see A035485).at n=16A057983
- Binomial transform of A054341 and inverse binomial transform of A049027.at n=8A059738
- These numbers take a record number of steps to reach the top of the deck in Guy's shuffle (see A060750).at n=14A060751
- Triangle T(n,k), 0 <= k <= n, read by rows given by: T(0,0)=1, T(n,k)=0 if k < 0 or if k > n, T(n,0) = 3*T(n-1,0) + T(n-1,1), T(n,k) = T(n-1,k-1) + T(n-1,k) + T(n-1,k+1) for k >= 1.at n=36A126954
- Riordan array (f(x), x*f(x)) where f(x) is the g.f. of A059738.at n=36A171505
- a(n) = 12*n^3 + 9*n^2 + 2*n.at n=11A191745
- Number of pairs of intersecting diagonals in the interior and exterior of a regular n-gon.at n=19A211380
- T(n, k) = P(n-k, k) where P(n, x) = Sum_{k=0..n} A064189(n, k)*x^k. Triangle read by rows, for 0 <= k <= n.at n=57A330792
- Irregular triangle read by rows: T(n,k) is the number of k-crossing partitions on 2n nodes, where all partition terms alternate in parity, counted up to reflection.at n=48A368054
- Number of n X n periodic matrices over GF(3).at n=3A373784
- Square array read by antidiagonals, where the top row is the powers of 2 (A000079) and the other numbers are the sum of the neighbors in the preceding row.at n=44A375723