17273
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
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 18048
- Proper Divisor Sum (Aliquot Sum)
- 775
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 16500
- Möbius Function
- 1
- Radical
- 17273
- 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
- 110
- 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 indecomposable binary [ n,4 ] codes without 0 columns.at n=16A034351
- n satisfying sigma(n+1) = sigma(n-1).at n=23A055574
- McKay-Thompson series of class 23A for Monster.at n=27A058570
- Numbers k such that sigma(k-1) divides sigma(k+1).at n=27A067130
- Least positive integer multiples of angle x such that their direction cosines form a unit vector: Sum_{k>0} cos(a(k)*x)^2 = 1, where a(1)=1 and x=3.at n=17A080138
- McKay-Thompson series of class 23A for the Monster group with a(0) = 1.at n=27A134781
- Least k such that k*(2^p-1)*(k*(2^p-1)+1)+1 is prime, where 2^p-1 runs through the Mersenne primes.at n=22A137909
- 50k^2-40k-17 interleaved with 50k^2+10k+13 for k=>0.at n=38A217893
- Numbers n such that Q(sqrt(n)) has class number 9.at n=28A218041
- Fundamental discriminants of real quadratic number fields with class number 9.at n=17A218159
- Numbers n such that sigma(n+1) - sigma(n-1) = k*n for some integer k, where sigma(n) = A000203 (sum of divisors of n).at n=24A223137
- Numbers k such that sigma(k+1) divides sigma(k-1).at n=24A227304
- a(n) = (n + 1)*(4*n^2 + 14*n + 9)/3.at n=22A268484
- Number of subsets of {1..n} containing no sums or products of distinct elements.at n=21A326024
- Expansion of Product_{k>=1} 1/((1 - x^k) * (1 - x^(2*k)) * (1 - x^(3*k)) * (1 - x^(4*k))).at n=22A327043