16347
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 21800
- Proper Divisor Sum (Aliquot Sum)
- 5453
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10896
- Möbius Function
- 1
- Radical
- 16347
- 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
- 159
- 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
- [ n(n-1)(n-2)(n-3)/13 ].at n=23A011923
- Fibonacci sequence beginning 2 9.at n=17A022114
- Positive numbers k such that k and 2*k are anagrams in base 8 (written in base 8).at n=34A023073
- Positive numbers k such that k and 4*k are anagrams in base 8 (written in base 8).at n=20A023075
- Sum{T(n-k,k)}, 0<=k<=[ n/2 ], T given by A026703.at n=18A026713
- Numbers whose set of base-11 digits is {1,3}.at n=34A032918
- Ranks of certain relations among Euler sums of weight n.at n=13A038360
- Coefficients A_n for the s=4 tennis ball problem.at n=4A078999
- Number of ways to place zero or more nonadjacent 1,0 1,1 2,1 3,1 4,2 5,2 5,3 polyhexes in any orientation on a planar nXnXn triangular grid.at n=7A155334
- Number of binary strings of length n with equal numbers of 0000 and 0001 substrings.at n=15A164147
- a(n) = 2^(n-5) - A000931(n).at n=14A216714
- a(0) = 4; for n>0, a(n) = a(n-1) + 2^n - 3.at n=13A249453
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 814", based on the 5-celled von Neumann neighborhood.at n=34A273644
- Decimal representation of the x-axis, from the left edge to the origin, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 133", based on the 5-celled von Neumann neighborhood.at n=13A279139
- Square array T(n,k), n >= 1, k >= 2, read by antidiagonals, where T(n,k) is the number of self-avoiding walks in the n X k grid graph which start at any of the n vertices on left side of the graph and terminate at any of the n vertices on the right side.at n=25A333509