14102
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 8
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 23112
- Proper Divisor Sum (Aliquot Sum)
- 9010
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6400
- Möbius Function
- -1
- Radical
- 14102
- 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
- 58
- 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 degenerate fanout-free Boolean functions of n variables using And, Or, Xor, Not, and Majority gates.at n=4A005740
- Expansion of sum ( q^n / product( 1-q^k, k=1..3*n), n=0..inf ).at n=30A035295
- a(n) = T(n,n-4), array T as in A055818.at n=19A055821
- a(1) = 1 and for n > 1 let a(n) = a(n-1) + m, where m is the arithmetic mean of the largest subset of all predecessors such that m is an integer and m is maximal.at n=35A063676
- a(0)=0, a(1)=1, a(n)=a(n-1)+a(n-2)+a(n-3) if a(n-1) is even, a(n)=a(n-1)+a(n-2) if a(n-1) is odd.at n=19A078513
- Integer part of the area of circles with prime radii.at n=18A097427
- Triangle read by rows: T(n,k) is number of paths from (0,0) to (3n,0) that stay in the first quadrant (but may touch the horizontal axis), consisting of steps u=(2,1), U=(1,2), or d=(1,-1) and having k u=(2,1) steps among the steps leading to the first d step.at n=40A108440
- Number of n-node rooted trees of height 9.at n=15A126085
- Numbers such that the digital sum base 2 and the digital sum base 3 and the digital sum base 10 all are equal.at n=16A135120
- Number of different strings of length n obtained from "abcdef" by iteratively duplicating any substring.at n=13A137746
- Constant term of the reduction by x^2 -> x+1 of the polynomial p(n,x) defined at Comments.at n=16A192962
- Number of unlabeled functions on n nodes that have at least one fixed point.at n=11A217896
- Number of idempotent basis elements in partition monoid P_n.at n=5A256035
- Number of n-step self-avoiding cycles on the hypertriangular lattice.at n=11A344070
- a(n) = sum for all integer partitions of n of the difference between number of different parts and number of different multiplicities.at n=31A373243