16926
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 32
- Divisor Sum
- 43008
- Proper Divisor Sum (Aliquot Sum)
- 26082
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4320
- Möbius Function
- -1
- Radical
- 16926
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 5
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
- 40
- 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 n-step self-avoiding walks on cubic lattice.at n=6A001412
- Least term in period of continued fraction for sqrt(n) is 10.at n=28A031434
- Base 6 digits are, in order, the first n terms of the periodic sequence with initial period 2,1,0.at n=5A037523
- q-factorial numbers 3!_q.at n=25A069778
- Number of different antisymmetric relations on n unlabeled points.at n=5A083670
- Convolution of the prime numbers with phi(n).at n=35A086734
- Denominators of n divided by the product of the anti-divisors of n.at n=43A093396
- 6 times octagonal numbers: a(n) = 6*n*(3*n-2).at n=31A153796
- a(n) = 100*n^2 + 2*n.at n=12A158127
- a(n) = 676*n^2 + 26.at n=5A158643
- a(n) = 25*n^2 + n.at n=25A173089
- Expansion of (8+6*x)/(1-x)^5.at n=11A190048
- Expansion of -2*x*(1+4*x) / ((2*x-1)*(4*x^2+3*x+1)).at n=13A200563
- The number of permutations of length n sortable by 3 prefix reversals (in the pancake sorting sense).at n=26A228398
- Number of n X 3 0..2 arrays x(i,j) with each element horizontally, diagonally or antidiagonally next to at least one element with value (x(i,j)+1) mod 3, and upper left element zero.at n=4A230464
- T(n,k)=Number of nXk 0..2 arrays x(i,j) with each element horizontally, diagonally or antidiagonally next to at least one element with value (x(i,j)+1) mod 3, and upper left element zero.at n=25A230469
- Number of 5Xn 0..2 arrays x(i,j) with each element horizontally, diagonally or antidiagonally next to at least one element with value (x(i,j)+1) mod 3, and upper left element zero.at n=2A230473
- Number of partitions p of n such that round(mean(p)) is a part of p; here, round(x) means floor(x + 1/2).at n=39A241733
- E.g.f. ((e^x-1)^2*e^x) / (2*(1-(e^x-1)^3)).at n=7A242858
- G.f.: Sum_{n>=0} x^n/((1+x)^(2*n+1)*(1 - (2*n+1)*x)).at n=8A245157