14136
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 32
- Divisor Sum
- 38400
- Proper Divisor Sum (Aliquot Sum)
- 24264
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4320
- Möbius Function
- 0
- Radical
- 3534
- 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
- 151
- 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 series-parallel networks with n unlabeled edges. Also called yoke-chains by Cayley and MacMahon.at n=10A000084
- Lexicographically earliest sequence of distinct positive integers such that no subsequence sums to a prime.at n=7A052349
- Numbers k such that sigma(x) = k has exactly 10 solutions.at n=23A060666
- Number of orbits into which the Foata transform partitions the symmetric group Sn, i.e., a(n) is the number of cycles in the permutations A065181 - A065184 found in range [0,n!-1].at n=11A065161
- Least number k such that round(k/pi(k)) = n.at n=7A107610
- Least positive k such that k * Z^n + 1 is prime, where Z = 10^100+267, the first prime greater than a googol.at n=28A108344
- Numbers n such that p(10n) is prime, where p(n) is the number of partitions of n.at n=22A114170
- Largest terms a(n) forming a self-convolution 4th power of an integer sequence (A132838) such that: a(n) <= 4*a(n-1) for n>0 with a(0)=1.at n=7A132837
- a(n) = Hermite(n,3).at n=6A144142
- Twice 12-gonal numbers: a(n) = 2*n*(5*n-4).at n=38A152965
- 6 times heptagonal numbers: a(n) = 3*n*(5*n-3).at n=31A153786
- Those positive integers n where, when written in binary, there are exactly k number of runs (of either 0's or 1's) each of exactly k length, for all k where 1<=k<=m, for some positive integer m.at n=33A175356
- Number of strings of numbers x(i=1..6) in 0..n with sum i*x(i)^2 equal to n*36.at n=15A184445
- For positive n with prime decomposition n = Product_{j=1..m} (p_j^k_j) define A_n = Sum_{j=1..m} (p_j*k_j) and B_n = Sum_{j=1..m} (p_j^k_j). This sequence gives those n for which A_n and B_n are both prime and B_n = A_n + 2 (i.e., form a twin prime pair).at n=30A185718
- Number of binary words of length n containing no subword 100001.at n=14A210031
- The 6th Hermite Polynomial evaluated at n: H_6(n) = 64*n^6-480*n^4+720*n^2-120.at n=3A247851
- Numbers n such that n*2^1279 - 1 is prime.at n=37A265502
- Number of ways writing n^2 as a sum of four squares: a(n) = A000118(n^2).at n=35A267326
- Number of active (ON, black) cells at stage 2^n-1 of the two-dimensional cellular automaton defined by "Rule 141", based on the 5-celled von Neumann neighborhood.at n=6A270283
- Lexicographically earliest sequence such that no subsequence sums to a prime.at n=7A280708