17575
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 23560
- Proper Divisor Sum (Aliquot Sum)
- 5985
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 12960
- Möbius Function
- 0
- Radical
- 3515
- Omega Function (Ω)
- 4
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 102
- 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
- no
- Odd
- yes
Appears in sequences
- Square pyramidal numbers: a(n) = 0^2 + 1^2 + 2^2 + ... + n^2 = n*(n+1)*(2*n+1)/6.at n=37A000330
- Restricted partitions.at n=16A001981
- Smallest integer m such that the product of every 3 consecutive integers > m has a prime factor > prime(n).at n=10A003032
- Smallest integer m such that the product of every 4 consecutive integers > m has a prime factor > prime(n).at n=14A003033
- Smallest integer m such that the product of every 4 consecutive integers > m has a prime factor > prime(n).at n=12A003033
- Smallest integer m such that the product of every 4 consecutive integers > m has a prime factor > prime(n).at n=15A003033
- Smallest integer m such that the product of every 4 consecutive integers > m has a prime factor > prime(n).at n=17A003033
- Smallest integer m such that the product of every 4 consecutive integers > m has a prime factor > prime(n).at n=16A003033
- Smallest integer m such that the product of every 4 consecutive integers > m has a prime factor > prime(n).at n=13A003033
- Odd square pyramidal numbers.at n=18A015221
- Strong pseudoprimes to base 26.at n=10A020252
- a(n) = s(1)*s(n) + s(2)*s(n-1) + ... + s(k)*s(n+1-k), where k = floor((n+1)/2), s = (odd natural numbers).at n=36A024598
- Gaps of 7 in sequence A038593 (upper terms).at n=38A038654
- Consider the line segment in R^n from the origin to the point P=(1,2,3,...,n); let d = squared distance to this line from the closest point of Z^n (excluding the endpoints). Sequence gives d times P.P.at n=36A059774
- a(n) = n^3 - 1.at n=25A068601
- Number of different hierarchical orderings that can be formed from n labeled elements: these are divided into groups and the elements in each group are then arranged in a "preferential arrangement" or "weak order" as in A000670.at n=6A075729
- Structured rhombic dodecahedral numbers (vertex structure 9).at n=18A100157
- a(n) = A107668(n)/(n+1)^2.at n=5A107669
- Triangle read by rows: T(n,k) is number of paths from (0,0) to (3n,0) that stay in the first quadrant (but may touch the horizontal axis), consisting of steps u=(2,1), U=(1,2), or d=(1,-1) and have k peaks of the form ud.at n=32A108446
- Number of partitions of n^2 into up to n parts each no more than 2n, or of n(3n+1)/2 into exactly n distinct parts each no more than 3n.at n=8A109655