16694
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
- 8
- Divisor Sum
- 26568
- Proper Divisor Sum (Aliquot Sum)
- 9874
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7840
- Möbius Function
- -1
- Radical
- 16694
- 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
- 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
- The sequence M(n) in A022905.at n=31A022908
- Even elements of A085493.at n=35A106431
- Number of partitions of n such that (greatest part) + (least part) > number of parts.at n=38A237870
- Number of nX3 0..1 arrays with every element equal to 0, 1, 3, 4 or 6 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=13A300939
- G.f. A(x,y) satisfies: Sum_{n=-oo...+oo} (x^n + y)^n = exp( (1-y) * A(x,y) ) / (1-y), where A(x,y) = Sum_{n>=1} x^n/n * Sum{k=0..n-1} T(n,k)*y^k, written here as a flattened triangle of coefficients T(n,k) read by rows.at n=38A321600
- Integers k equal to the sum over A000203(t) mod t, for some steps, starting with t = k and then using the result to feed the next calculation.at n=32A377001