14602
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 25650
- Proper Divisor Sum (Aliquot Sum)
- 11048
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6216
- Möbius Function
- 0
- Radical
- 2086
- Omega Function (Ω)
- 4
- 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
- 45
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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-bead necklaces with 2 colors when turning over is not allowed; also number of output sequences from a simple n-stage cycling shift register; also number of binary irreducible polynomials whose degree divides n.at n=18A000031
- Number of vertex-transitive graphs with n nodes.at n=36A006799
- [ (4th elementary symmetric function of P(n))/(first elementary symmetric function of P(n)) ], where P(n) = {1, p(1), p(2), ..., p(n-1)}, where p(0) = 1.at n=6A024533
- Number of nonisomorphic circulant graphs, i.e., undirected Cayley graphs for the cyclic group of order n.at n=36A049287
- Number of nonisomorphic circulant digraphs (i.e., Cayley digraphs for the cyclic group) of order n.at n=18A049297
- Number of step shifted (decimated) sequence structures using a maximum of two different symbols.at n=18A056391
- a(n) = 15*n^2 + 6*n + 1.at n=31A080861
- 0 together with numbers k such that 8*R_k - 7 is a prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=15A099421
- Bisection of A000031.at n=9A100446
- Number of necklaces with n beads of 3 colors, no 2 adjacent beads the same color.at n=17A106365
- Number of distinct n X 2 toroidal binary arrays.at n=8A184264
- Table read by antidiagonals: T(n,k) = number of distinct n X k toroidal binary arrays (n >= 1, k >= 1).at n=46A184271
- Number of Cayley graphs on n nodes.at n=36A185959
- Number of (n+2) X 6 binary arrays avoiding patterns 001 and 110 in rows, columns and nw-to-se diagonals.at n=8A202443
- a(n) = floor((n+1)*(n-3)*(n-4)/12).at n=58A212772
- 2^(p-1) modulo p^3, where p = prime(n).at n=10A271234
- Number of circulant graphs on n vertices up to Cayley isomorphism.at n=36A285620
- Number of partitions of 2*n into exactly n squarefree parts.at n=47A341153
- Triangle read by rows: coefficients in expansion of another Asveld's polynomials Pi_j(x).at n=29A366133
- Triangle read by rows: T(n,k) is the number of partitions of a 3-colored set of n objects into at most k parts with 0 <= k <= n.at n=52A382045