16346
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 26784
- Proper Divisor Sum (Aliquot Sum)
- 10438
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7420
- Möbius Function
- -1
- Radical
- 16346
- 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) = a(n-1) + a(n-2) + 1, with a(0) = 1 and a(1) = 8.at n=17A022322
- Number of rooted trees with n nodes and 8 leaves.at n=6A055283
- Numerators of the coefficients in power series expansion of exp(2x/(1-x)).at n=6A067654
- Numbers n for which there are exactly twelve k such that n = k + reverse(k).at n=11A072435
- a(n) = A082613(n) divided by the n-th power that divides it.at n=18A082614
- Number of simple graphs g on n nodes with |Aut(g)| = 16.at n=9A095854
- Row sums of triangle A131243.at n=12A131244
- Row sums of triangle A132729.at n=13A132730
- Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k doubledescents (0 <= k <= n-2). We say that i is a doubledescent (also called a double fall) of a permutation p if p(i) > p(i+1) > p(i+2).at n=24A162975
- Combined weight, as defined at A244094, of the distinct-parts partitions of n.at n=26A234924
- Number of ways to group the first 2*n natural numbers into n pairs (xi,yi) with yi>xi, and such that the 2*n numbers xi+yi and xi-yi are all different.at n=8A272363
- Number of permutations of [n] having exactly one doubledescent.at n=8A274997
- Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 361", based on the 5-celled von Neumann neighborhood.at n=13A287788
- Sum of the fifth largest parts in the partitions of n into 6 parts.at n=49A308869
- Numbers k at which point A336459(k) appears multiplicative, but A051027(k) does not.at n=27A336561
- Triangle read by rows: numerators of the almost-Riordan array ( (-6*x - 3 - 3*sqrt(12*x^2 - 8*x + 1))/(8*x^2 - 3*x - 3 + (3*x - 3)*sqrt(12*x^2 - 8*x + 1)) | 6/(3*(1 - x)*sqrt(12*x^2 - 8*x + 1) - 8*x^2 + 3*x + 3), (1 - 4*x - sqrt(12*x^2 - 8*x + 1))/(2*x) ).at n=45A389739