16994
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
- 4
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 26460
- Proper Divisor Sum (Aliquot Sum)
- 9466
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8176
- Möbius Function
- -1
- Radical
- 16994
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 128
- 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
- Number of partitions of n with equal number of even and odd parts.at n=52A045931
- a(n) = 2^n + Fibonacci(n+1).at n=14A052956
- Trajectory of n under the Reverse and Add! operation carried out in base 2 does not reach a palindrome and (presumably) does not join the trajectory of any term m < n.at n=40A075252
- a(n) = smallest k such that the base-2 Reverse and Add! trajectory of A075252(n) joins the trajectory of k.at n=40A092211
- G.f. satisfies: A(x) = 1/(1 - x*A(x)/(1 - x*A(x)^2/(1 - x*A(x)^3/(1 - x*A(x)^4/(1 - ...))))), a recursive continued fraction.at n=7A192737
- Number of nX3 0..3 arrays with no element equal to zero plus the sum of elements to its left or two plus the sum of elements above it or zero plus the sum of the elements diagonally to its northwest, modulo 4.at n=4A240378
- T(n,k)=Number of nXk 0..3 arrays with no element equal to zero plus the sum of elements to its left or two plus the sum of the elements above it or zero plus the sum of the elements diagonally to its northwest, modulo 4.at n=25A240381
- Number of 5Xn 0..3 arrays with no element equal to zero plus the sum of elements to its left or two plus the sum of the elements above it or zero plus the sum of the elements diagonally to its northwest, modulo 4.at n=2A240385
- Number of (n+2) X (4+2) 0..3 arrays with every 3 X 3 subblock row and column sum 1 3 6 or 8 and every diagonal and antidiagonal sum not 1 3 6 or 8.at n=5A252011
- Number of (n+2)X(6+2) 0..3 arrays with every 3X3 subblock row and column sum 1 3 6 or 8 and every diagonal and antidiagonal sum not 1 3 6 or 8.at n=3A252013
- T(n,k) = Number of (n+2) X (k+2) 0..3 arrays with every 3 X 3 subblock row and column sum 1 3 6 or 8 and every diagonal and antidiagonal sum not 1 3 6 or 8.at n=39A252015
- Number of combinatory separations of normal multisets of weight n.at n=7A269134
- Number of cubic graphs on n unlabeled nodes with half-edges.at n=13A333163
- Numbers k such that the k-th composition in standard order is a permutation (of an initial interval).at n=44A333218
- Numbers k such that the k-th composition in standard order is a non-alternating permutation of an initial interval of positive integers.at n=25A350250
- Index where n first appears in A381658.at n=54A381659