17550
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 48
- Divisor Sum
- 52080
- Proper Divisor Sum (Aliquot Sum)
- 34530
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4320
- Möbius Function
- 0
- Radical
- 390
- Omega Function (Ω)
- 7
- Little Omega Function (ω)
- 4
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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 141
- 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
- Let A(n) = #{(i,j,k): i^2 + j^2 + k^2 <= n}, V(n) = (4/3)Pi*n^(3/2), P(n) = A(n) - V(n); sequence gives values of n where |P(n)| sets a new record.at n=47A000092
- Binomial coefficient binomial(n,4) = n*(n-1)*(n-2)*(n-3)/24.at n=27A000332
- a(n) = (4*n+1)*(4*n+2)*(4*n+3).at n=6A001505
- Binomial coefficient C(3n,n-5).at n=4A004323
- Number of intersections of diagonals in the interior of a regular n-gon.at n=26A006561
- a(n) = n*(n-1)*(n-2) (or n!/(n-3)!).at n=27A007531
- Binomial coefficient C(27,n).at n=4A010943
- Binomial coefficient C(27,n).at n=23A010943
- Binomial coefficient C(n,23).at n=4A010976
- a(n) = floor( n*(n-1)*(n-2)*(n-3)/28 ).at n=28A011938
- Binomial coefficients: C(n,k), 4 <= k <= n-4, sorted, duplicates removed.at n=39A024756
- a(n) = 225*(n-1)*(n-2)/2.at n=11A027470
- a(n) = lcm(n,n+1,n+2).at n=24A033931
- Let (u1,u2) be successive untouchable numbers such that phi(u1) = phi(u2); sequence gives values of u1.at n=35A048189
- T(n,4), array T as in A050186; a count of aperiodic binary words.at n=23A050189
- a(n) = binomial(n, floor(n/6)).at n=27A051053
- Denominator of b(n)-b(n+1), where b(n) = n/((n+1)(n+2)) = A026741/A045896.at n=23A051713
- Binomial coefficients binomial(2*n-3,4).at n=11A053126
- a(n) = 3*n*(3*n-1)*(3*n-2).at n=9A054776
- Numbers k such that 7*2^k - 5 is prime.at n=33A058602