17479
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 28
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 5
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 21888
- Proper Divisor Sum (Aliquot Sum)
- 4409
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 13560
- Möbius Function
- -1
- Radical
- 17479
- Omega Function (Ω)
- 3
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 172
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (composite numbers), t = (odd natural numbers).at n=37A024590
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (composite numbers), t = (odd natural numbers).at n=36A025104
- Numbers whose base-4 representation has exactly 8 runs.at n=2A043599
- Numbers n such that number of runs in the base 4 representation of n is congruent to 1 mod 7.at n=23A043844
- Numbers n such that number of runs in the base 4 representation of n is congruent to 0 mod 8.at n=2A043850
- Numbers n such that number of runs in the base 4 representation of n is congruent to 8 mod 9.at n=2A043866
- Numbers k such that number of runs in the base 4 representation of k is congruent to 8 mod 10.at n=2A043875
- Number of ways to write n as an ordered sum of 1's, 2's and 3's such that no 2 precedes any 1.at n=24A124062
- Number of binary strings of length n with equal numbers of 00011 and 00100 substrings.at n=15A164228
- a(n) = (2*n+1)*(6*n-1).at n=38A179741
- E.g.f. satisfies (1-x*A(x))*A(x*e^x)=1.at n=7A184932
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 579", based on the 5-celled von Neumann neighborhood.at n=26A273028
- Number of non-equivalent ways to place 2 non-attacking kings on an n X n board.at n=22A279111
- Smallest k such that A285481(k) >= n, i.e., lowest d where the smallest integer radius needed for a d-dimensional ball to have a volume >= 1 is at least n.at n=32A285482
- Numbers that are the sum of four third powers in six or more ways.at n=13A345148
- Numbers that are the sum of four third powers in exactly six ways.at n=12A345149