17227
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 20736
- Proper Divisor Sum (Aliquot Sum)
- 3509
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 13992
- Möbius Function
- -1
- Radical
- 17227
- Omega Function (Ω)
- 3
- 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
- 79
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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(n) = Fibonacci(n) - n^2.at n=22A014283
- Numbers k such that k + sum of its prime factors = (k+1) + sum of its prime factors.at n=24A020700
- Partial sums of A087100.at n=25A087098
- a(n) = L(n) + 2^n where L(n) = A000032(n) (the Lucas numbers).at n=14A088859
- a(n) = 7 + floor((1 + Sum_{j=1..n-1} a(j))/4).at n=35A120165
- a(n) = A007318 * [1, 6, 14, 9, 0, 0, 0, ...].at n=22A143690
- a(n) = Sum_{d|n} phi(n/d)^(d-1).at n=39A164941
- Partial sums of A018805.at n=42A177853
- Number of (n+3) X 9 0..1 matrices with each 4 X 4 subblock idempotent.at n=14A224566
- Number of standard Young tableaux with n cells and 3 as last value in the first row.at n=12A245001
- Numbers k such that (25*10^k - 13)/3 is prime.at n=20A281142
- Solution of the complementary equation a(n) = 2*a(n-1) - a(n-2) + b(n-1) + 3, where a(0) = 1, a(1) = 2, b(0) = 3, and (a(n)) and (b(n)) are increasing complementary sequences.at n=41A294871
- G.f. A(x) satisfies: 1 = Sum_{n>=0} x^n * ((1+x)^(4*n) - A(x))^(n+1), where A(0) = 0.at n=5A307954
- Number of regions after n generations of Jim Conant's iterative dissection of a square.at n=16A328078
- Number of regions after 2n generations of Jim Conant's iterative dissection of a square.at n=8A328080
- Number of integer partitions of n with more adjacent equal parts than distinct parts.at n=39A360254
- a(n) = Sum_{1 <= x_1, x_2, x_3 <= n} gcd(x_1, x_2, x_3, n)^4.at n=9A372929
- Number of integer partitions of n with all equal lengths of maximal runs of consecutive parts decreasing by 1 but not by 0.at n=48A384904