16949
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
- 4
- Divisor Sum
- 17964
- Proper Divisor Sum (Aliquot Sum)
- 1015
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 15936
- Möbius Function
- 1
- Radical
- 16949
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- 35
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- Number of connected functions (or mapping patterns) on n unlabeled points, or number of rings and branches with n edges.at n=11A002861
- Numbers k such that the continued fraction for sqrt(k) has period 77.at n=22A020416
- Numbers having four 2's in base 9.at n=30A043464
- Numbers n such that 2^n - 21 is prime.at n=26A057202
- McKay-Thompson series of class 38a for Monster.at n=47A058658
- Absolute value of determinant of n X n matrix where the element a(i,j) = if i + j > n then 2*(i + j -n) - 1, else 2*(n + 1 - i - j).at n=7A083877
- Number of ways to partition the set of divisors of the n-th abundant number into three subsets such that their sums form an integer triangle.at n=35A091235
- Numbers k such that 2^k - 21 is prime.at n=22A096820
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, -1), (0, 0, 1), (1, 0, -1), (1, 1, 0)}.at n=8A150132
- a(n) = n*(6*n^2 + 15*n + 5)/2.at n=17A163833
- Number of n X n 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 1,4,0,2,3 for x=0,1,2,3,4.at n=4A196338
- Number of nX5 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 1,4,0,2,3 for x=0,1,2,3,4.at n=4A196340
- T(n,k)=Number of nXk 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 1,4,0,2,3 for x=0,1,2,3,4.at n=40A196343
- Expansion of Product_{k>=1} (1 + x^(3*k)) / (1 - x^k).at n=31A266648
- Number of 4-cycles in the n X n king graph.at n=38A288918
- a(n) = 3*binomial(n,4) - 6*binomial(n,3) + 4*binomial(n,2) - 2.at n=23A335694
- Number of integer partitions of n where the parts do not have the same mean as the distinct parts.at n=36A360242