17885
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 29
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 25308
- Proper Divisor Sum (Aliquot Sum)
- 7423
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 12096
- Möbius Function
- 0
- Radical
- 2555
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 48
- 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
- no
- Odd
- yes
Appears in sequences
- Centered icosahedral (or cuboctahedral) numbers, also crystal ball sequence for f.c.c. lattice.at n=17A005902
- Pisot sequence E(9,17), a(n) = floor( a(n-1)^2/a(n-2) + 1/2 ).at n=12A014004
- a(n) = (n+5)^3 - n^3.at n=32A038867
- Number of planar partitions of n with exactly 2 rows.at n=21A091356
- a(n) = 8 + floor( (1 + Sum_{j=1..n-1} a(j)) / 2).at n=19A120137
- Number of (w,x,y,z) with all terms in {1,...,n} and |w-x| = 2*|x-y| - |y-z|.at n=35A212578
- Number of length n+1 0..4 arrays with the sum of the squares of adjacent differences multiplied by some arrangement of +-1 equal to zero.at n=5A250273
- T(n,k)=Number of length n+1 0..k arrays with the sum of the squares of adjacent differences multiplied by some arrangement of +-1 equal to zero.at n=41A250277
- Number of length 6+1 0..n arrays with the sum of the squares of adjacent differences multiplied by some arrangement of +-1 equal to zero.at n=3A250281
- Triangle read by rows: T(n,k) (n>=1, k>=1) is the number of posets with n elements whose Hasse diagram has k connected components.at n=58A263864
- Number of 3 X n 0..1 arrays with every 1 horizontally or antidiagonally adjacent to 2 neighboring 1s.at n=16A297300
- Number of ways to choose a strict rooted partition of each part in a strict rooted partition of n.at n=26A301754
- Number of 4-element subsets of [n] having a prime element sum.at n=35A320679
- Numbers n for which A325565(n) < A325568(n).at n=42A325569
- Number of self-avoiding walks in the n X 2 grid graph which start at any of the n vertices on left side of the graph and terminate at any of the n vertices on the right side.at n=10A333510
- 32-gonal numbers: a(n) = n*(15*n-14).at n=35A360436
- Number of integer partitions of n such that it is possible to choose a different constant integer partition of each part.at n=49A387330