17039
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 18600
- Proper Divisor Sum (Aliquot Sum)
- 1561
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 15480
- Möbius Function
- 1
- Radical
- 17039
- 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
- 159
- 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
- Number of partitions of floor(5n/2)-1 into n nonnegative integers each no more than 5.at n=40A001976
- Gaps of 2 in sequence A038593 (upper terms).at n=17A038644
- Numerators of continued fraction convergents to sqrt(641).at n=5A042230
- Structured heptagonal diamond numbers (vertex structure 5).at n=21A100179
- Integers k such that 7*10^k + 31 is a prime number.at n=8A111021
- 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, 0), (-1, 0, 1), (1, -1, 1), (1, 0, 1), (1, 1, -1)}.at n=8A149410
- Number of partitions p of n such that (maximal multiplicity of the parts of p) < (maximal part of p).at n=37A240310
- Integers of the form 8k + 7 that can be written as a sum of four distinct squares of the form m, m + 2, m + 3, m + 4, where m == 2 (mod 4).at n=15A243581
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 297", based on the 5-celled von Neumann neighborhood.at n=29A271150
- Take a squarefree semiprime and take the difference of its prime factors. If it is a squarefree semiprime repeat the process. Sequence lists the squarefree semiprimes that generate other squarefree semiprimes only in the first k steps of this process. Case k = 4.at n=35A296811
- Number of nXn 0..1 arrays with every element unequal to 0, 1, 2, 3, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=4A317224
- Number of n X 5 0..1 arrays with every element unequal to 0, 1, 2, 3, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=4A317227
- T(n,k)=Number of nXk 0..1 arrays with every element unequal to 0, 1, 2, 3, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=40A317230
- G.f. A(x) = Sum_{n>=1} a(n)*x^(2*n-1) satisfies: A(x*R(x)) = x^2 - x^4, where A(R(x)) = x.at n=7A350474
- Consecutive states of the linear congruential pseudo-random number generator (2041*s + 25673) mod 121500 when started at s=1.at n=26A385362