16834
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 26640
- Proper Divisor Sum (Aliquot Sum)
- 9806
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7956
- Möbius Function
- -1
- Radical
- 16834
- 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
- 159
- 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
- a(n) = floor(3^n / 2^n).at n=24A002379
- [ sqrt(3/2)^n ].at n=48A014215
- Number of ways to place 4 nonattacking kings on an n X n board.at n=6A061997
- Values of floor((3/2)^n) that are composite.at n=14A070758
- Expansion of 1/((1-x)*(1+x+2*x^2+x^3)).at n=36A077913
- a(n) = floor(9^n/4^n).at n=12A094981
- Triangle T(m,k) read by rows, where T(m,k) is the number of ways in which 1<=k<=m positions can be picked in an m X m square array such that all positions are mutually isolated. Two positions (s,t),(u,v) are considered as isolated from each other if min(abs(s-u),abs(t-v))>1.at n=18A098487
- Count of interior bounded regions in a regular 2n-sided polygon dissected by all diagonals parallel to sides.at n=16A165217
- Round (3/2)^n.at n=26A179523
- Number of increasing sequences of n integers x(1),...,x(n) with values in 1..5*n such that x(j) divides x(k) iff j divides k.at n=38A180382
- Diagonal sums of generalized Narayana triangle A180957.at n=18A180958
- Triangle read by rows: T(n,k) = number of ways to place k nonattacking kings on an n X n board.at n=29A193580
- a(n) = modlg(n^n, 2^n), where modlg is the function defined in A215894: modlg(a,b) = floor(a / b^floor(logb(a))), logb is the logarithm base b.at n=23A216021
- Numbers of the form 3^j + 7^k, for j and k >= 0.at n=47A226816
- Number of (5+1) X (n+1) 0..1 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction.at n=29A250659
- Number of octonary sequences of length n such that no two consecutive terms have distance 3.at n=5A287814
- Number of nX3 0..1 arrays with every element equal to 0, 3, 4, 5 or 7 king-move adjacent elements, with upper left element zero.at n=17A298584
- G.f.: Sum_{n>=0} (n+1) * (x + x^n)^n.at n=69A325997
- Numbers that are the sum of five fourth powers in three or more ways.at n=16A344243
- Numbers that are the sum of five fourth powers in exactly three ways.at n=16A344244