14126
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 24240
- Proper Divisor Sum (Aliquot Sum)
- 10114
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6048
- Möbius Function
- -1
- Radical
- 14126
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 102
- 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 partitions into non-integral powers.at n=43A000327
- a(n) is the concatenation of n and 9n.at n=13A009474
- Expansion of 1/((1-x)(1-10x)(1-11x)(1-12x)).at n=3A025190
- Concatenation of the first n numbers in binary (converted to base 10).at n=5A047778
- a(n)=Sum{T(n,j): j=1,2,...,n}, array T given by A048201.at n=26A048209
- The first n digits of the juxtaposition of the base-2 numbers converted to decimal.at n=13A055143
- McKay-Thompson series of class 26B for Monster.at n=30A058597
- Sides of integer Heronian triangles [A068967(n), prime(A068967(n)), a(n)] with area A068969(n).at n=19A068968
- Smallest multiple of n beginning with n and having a digit sum n, or 0 if no such number exists.at n=13A077727
- Expansion of q^(-1) * (chi(-q^13) / chi(-q))^2 in powers of q where chi() is a Ramanujan theta function.at n=30A128518
- Array read by antidiagonals: row b lists the base-b analog of the base-10 sequence 1, 12, 123, ..., 123456789, 12345678910, ... (A007908).at n=26A179069
- Number of ways to choose 3 points in an n X n X n triangular grid so that they do not form a 2 X 2 X 2 triangle.at n=7A234250
- Number of Sidon subsets of {1,...,n} of size 5.at n=24A241689
- Number of length n+6 0..3 arrays with no seven consecutive terms having four times the sum of any three elements equal to three times the sum of the remaining four.at n=0A249192
- T(n,k)=Number of length n+6 0..k arrays with no seven consecutive terms having four times the sum of any three elements equal to three times the sum of the remaining four.at n=3A249197
- Number of length 1+6 0..n arrays with no seven consecutive terms having four times the sum of any three elements equal to three times the sum of the remaining four.at n=2A249198
- Number T(n,k) of permutations p of [n] such that the up-down signature of p has nonnegative partial sums with a maximal value of k; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=49A262125
- Square array A(m,n) = number whose binary expansion is the concatenation of those of { m, m+1, ..., m+n }, with m, n >= 1, read by falling antidiagonals.at n=10A285806
- Number of permutations p of [n] such that the up-down signature of p has nonnegative partial sums with a maximal value of four.at n=5A320978
- Expansion of e.g.f. exp(1 - x - exp(3*x)).at n=7A367744