17176
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 34200
- Proper Divisor Sum (Aliquot Sum)
- 17024
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8064
- Möbius Function
- 0
- Radical
- 4294
- Omega Function (Ω)
- 5
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 27
- 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
- Coordination sequence for MgZn2, Position Zn1.at n=33A009937
- Even octagonal numbers: a(n) = 4*n*(3*n-1).at n=38A014642
- a(n) = (prime(n+2)^2 - 1)/3.at n=46A024700
- a(n) = least k such that 1+2+...+k >= E{1,2,...,n}, where E is the 3rd elementary symmetric function.at n=41A027917
- Numbers whose base-7 representation has exactly 6 runs.at n=16A043621
- Numbers m such that 2*m - sigma(m) is a divisor of m and greater than one, where sigma = A000203 is the sum of divisors.at n=12A060326
- Sequence is {a(3,n)}, where a(m,n) is defined at sequence A111518.at n=11A111521
- A triangular sequence:f(n)=Sum[StirlingS2[n, k], {k, 1, n}];t(n,m)=Binomial[n, m]*f(m + 1)*f(n - m + 1)-Binomial[n,0]*f(1)*f(n+1)+1.at n=30A174639
- A triangular sequence:f(n)=Sum[StirlingS2[n, k], {k, 1, n}];t(n,m)=Binomial[n, m]*f(m + 1)*f(n - m + 1)-Binomial[n,0]*f(1)*f(n+1)+1.at n=33A174639
- Numbers n such that the sum of the distinct prime factors of prime(n)-1 and prime(n+1)-1 are the same.at n=13A259562
- Deficient-perfect numbers: Deficient numbers n such that n/(2n-sigma(n)) is an integer.at n=27A271816
- Bi-unitary deficient-perfect numbers: bi-unitary deficient numbers k for such that 2*k - bsigma(k) is a bi-unitary divisor of k, where bsigma(k) is the sum of bi-unitary divisors of k (A188999).at n=26A303358
- E.g.f. C(x,y) = cos(y) / sqrt(1 - sin(x)^2 - sin(y)^2).at n=17A324609
- E.g.f. C(y,x) = cos(x) / sqrt(1 - sin(x)^2 - sin(y)^2).at n=18A324611
- a(n) = Sum_{k=1..n} k * sigma_2(k).at n=14A356125
- a(n) = sum of the first n primes whose distance to next prime is 4.at n=39A360226
- a(n) = Lucas(2*n) + 2^(n + 1) + 1.at n=9A366511
- Expansion of e.g.f. 1/sqrt(exp(-2*x) - 2*x).at n=5A380014