14868
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 27
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 36
- Divisor Sum
- 43680
- Proper Divisor Sum (Aliquot Sum)
- 28812
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4176
- Möbius Function
- 0
- Radical
- 2478
- Omega Function (Ω)
- 6
- Little Omega Function (ω)
- 4
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
- 133
- 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 transfer impedances of an n-terminal network.at n=5A003129
- Number of partitions satisfying 0 < cn(1,5) + cn(4,5) + cn(2,5) + cn(3,5).at n=35A039896
- a(n) equals the (n*(n+1)/2)-th partial sum of the self-convolution cube of A010054, which has the g.f.: Sum_{k>=0} x^(k*(k+1)/2).at n=30A109414
- Triangle read by rows: T(n,k) = a(k)*binomial(n,k) (0 <= k <= n), where a(0)=1, a(1)=2, a(k) = a(k-1) + 3*a(k-2) for k >= 2 (a(k) = A006138(k)).at n=60A124959
- Number of chiral pairs of polyominoes with n cells that have precisely the symmetry group of order 4 generated by 90-degree rotations.at n=40A144553
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, -1), (-1, -1, 0), (0, 1, -1), (0, 1, 0), (1, 0, 1)}.at n=8A150014
- Numbers k such that 64*k^6 + 1091 is prime.at n=16A155809
- Partial sums of A028388 good primes (version 2).at n=41A172166
- Averages q of twin prime pairs, such that q concatenated to q is also the average of a twin prime pair.at n=22A235109
- Number of length n 1..(4+1) arrays with every leading partial sum divisible by 2, 3, 5, 7 or 11.at n=6A254943
- T(n,k) is the number of length n 1..(k+1) arrays with every leading partial sum divisible by 2, 3, 5, 7 or 11.at n=51A254947
- Number of length 7 1..(n+1) arrays with every leading partial sum divisible by 2, 3, 5, 7 or 11.at n=3A254954
- Number of solutions to c(1)*prime(1)+...+c(2n-1)*prime(2n-1) = -2, where c(i) = +-1 for i > 1, c(1) = 1.at n=11A261057
- Number of active (ON, black) cells at stage 2^n-1 of the two-dimensional cellular automaton defined by "Rule 454", based on the 5-celled von Neumann neighborhood.at n=7A272277
- Number of 5-cycles in the n-tetrahedral graph.at n=6A289793
- Least nonnegative integer which requires n letters to spell in Turkish excluding spaces and hyphens.at n=26A305100
- Number of unlabeled spanning intersecting set-systems on n vertices.at n=5A305854
- a(n) is the smallest m > n such that n^2*(n^2 + 1) divides m^2*(m^2 + 1).at n=41A308935
- a(n) is the next number after a(n-1) which cannot be represented in the form 2*a(i) and Sum_{j=1..n-1} b_j*a(j) where 0 < i < n, b_j = 1 or 0. The sequence starts: a(1) = 1; a(2) = 2; a(3) = 3; a(4) = 5.at n=16A331811
- a(n) is the number of totally alternating permutations of 1,2,...,n.at n=11A332345