17453
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
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 18048
- Proper Divisor Sum (Aliquot Sum)
- 595
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 16860
- Möbius Function
- 1
- Radical
- 17453
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 141
- 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
- a(1) = 1; a(n+1) = sum of terms in continued fraction for sum of continued fractions, [a(n); a(n-1), a(n-2),...,a(1)] and [0; a(n), a(n-1), a(n-2),...,a(1)].at n=14A058083
- Number of degeneracies on the sets of n ordinary trees with n vertices. These are the values of the average distance sum connectivity index, J, in Table 15 of the paper by Elena V. Konstantinova and Maxim V. Vidyuk.at n=8A125067
- 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, -1, 0), (-1, 1, -1), (0, 0, -1), (1, 0, 1), (1, 1, -1)}.at n=9A149102
- 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, -1, 0), (-1, 0, -1), (0, 0, 1), (1, 0, 0), (1, 1, 1)}.at n=7A151116
- A vector sequence with set row sum function: row(n)=-Product[3*k - 1, {k, 0, n}] and linear build up and decline function: f(n,m)=Floor[(m/n)*row(n)].at n=22A152972
- A vector sequence with set row sum function: row(n)=-Product[3*k - 1, {k, 0, n}] and linear build up and decline function: f(n,m)=Floor[(m/n)*row(n)].at n=26A152972
- a(n) is the binary number (shown here in decimal) constructed from quadratic residues of 65537 in range [(n^2)+1,(n+1)^2] in such a way that quadratic residues are mapped to 1-bits, and non-quadratic residues (as well as the multiples of 65537) to 0-bits, with the lower end of range mapped to less significant, and the higher end of range to more significant bits.at n=7A179417
- Composite numbers whose sum of aliquot parts divides the sum of aliquot parts of the numbers less than or equal to n and relatively prime to n.at n=8A249108
- Total number of torsion-free congruence subgroups of PSL(2,Z) of genus n.at n=17A258696
- Pierce Expansion of coth(1).at n=13A280093
- Numerators of r(n) := Sum_{k=0..n-1} 1/Product_{j=0..4} (k + j + 1), for n >= 0, with r(0) = 0.at n=31A300298
- Numbers k such that k![4] - 256 is prime, where k![4] = A007662(k) = quadruple factorial.at n=34A329177
- Numbers k such that k and 4k, taken together, contain all digits 1 though 9 at least once.at n=26A346135
- G.f.: Sum_{k>=0} x^k * Product_{j=1..3*k} (1 + x^j).at n=52A385067