16714
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
- 25668
- Proper Divisor Sum (Aliquot Sum)
- 8954
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8160
- Möbius Function
- -1
- Radical
- 16714
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 66
- 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
- yes
- Odd
- no
Appears in sequences
- Total sum of squares of parts in all partitions of n.at n=15A066183
- Expansion of 2*(x^2-9*x+15) / ((1+x)*(1-3*x+x^2)).at n=7A090692
- Number of self-avoiding walks of length n on an infinite triangular prism starting at the origin.at n=10A107069
- Start with a(1)=1; now a(n+1)=a(n)+a(k) with k=[n-n-th digit of Pi]. If k<0 or k=0, then a(k)=0.at n=37A133389
- Number of n X n 0..4 arrays with values 0..4 introduced in row major order and each element equal to no more than two horizontal and vertical neighbors.at n=2A198521
- Number of nX3 0..4 arrays with values 0..4 introduced in row major order and each element equal to no more than two horizontal and vertical neighbors.at n=2A198523
- T(n,k) is the number of n X k 0..4 arrays with values 0..4 introduced in row major order and each element equal to no more than two horizontal and vertical neighbors.at n=12A198528
- Number of (w,x,y) with all terms in {0,...,n} and w != max(|w-x|, |x-y|).at n=25A213501
- Years >= 1801 in which Christmas falls in Sukkot.at n=34A222419
- Number of Dyck paths of semilength n avoiding the pattern U^(n-1) D^(n-1).at n=8A225692
- Triangle read by rows: T(n,k) (n >= 1, k >= 0) = number of Dyck paths of semilength k avoiding the pattern U^n D^n.at n=74A238094
- Consider a number of k digits n = d_(k)*10^(k-1) + d_(k-1)*10^(k-2) + … + d_(2)*10 + d_(1). Sequence lists the numbers n such that Sum_{i=1..k-1}{sigma(Sum_{j=1..i}{d_(j)*10^(j-1)})} = Sum_{i=1..k-1}{phi(Sum_{j=1..i}{d_(k-j+1)*10^(i-j)})} (see example below).at n=14A244068
- Number of tilings of a 5 X n rectangle using n pentominoes of shapes Z, I, P.at n=10A264765