17738
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 26
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 31122
- Proper Divisor Sum (Aliquot Sum)
- 13384
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7560
- Möbius Function
- 0
- Radical
- 2534
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 79
- Smith Number
- yes
- 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
- a(n) = b(n) + d(n), where b(n) = (n-th Fibonacci number > 1) and d(n) = (n-th non-Fibonacci number).at n=19A023483
- n-th non-Lucas number plus Fibonacci(n + 1).at n=20A023490
- Expansion of 1/((1-6x)(1-9x)(1-11x)(1-12x)).at n=3A028218
- Number of partitions satisfying 0 < cn(0,5) + cn(2,5) + cn(3,5).at n=36A039899
- Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n having pyramid weight k.at n=74A091866
- Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n having k exterior pairs.at n=50A091977
- Triangle read by rows: T(n,k) is the number of Motzkin paths of length n having k high humps. (A hump is an upstep followed by 0 or more flatsteps followed by a downstep. A high hump is a hump that starts at a level higher than zero.).at n=47A097888
- Number of (n+2) X 7 0..1 arrays with every 3 X 3 subblock having three equal elements in a row horizontally, vertically, diagonally or antidiagonally exactly three ways, and new values 0..1 introduced in row major order.at n=18A204751
- Number of unlabeled rooted trees with n nodes such that the minimal outdegree of inner nodes equals 10.at n=54A244464
- Number of (n+2) X (5+2) 0..1 arrays with no 3 x 3 subblock diagonal sum 0 and no antidiagonal sum 3 and no row sum 1 and no column sum 1.at n=19A257444
- Number of 5Xn 0..1 arrays with every element equal to 0 or 1 horizontally or antidiagonally adjacent elements, with upper left element zero.at n=16A301794
- Number of subsets of {1..n} containing n such that every subset has a different sum.at n=31A325866
- E.g.f.: -log(1 + x + log(1 - x)).at n=7A331559
- Total surface area of all rectangular prisms with dimensions p X q X q, where p and q are prime, n = p+q and p<q.at n=55A335188
- Number of ways to write n as an ordered sum of 8 primes.at n=20A340964
- a(n) = Sum_{d|n} phi(d)^(n/d+1).at n=35A342488