14952
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 32
- Divisor Sum
- 43200
- Proper Divisor Sum (Aliquot Sum)
- 28248
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4224
- Möbius Function
- 0
- Radical
- 3738
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 89
- 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
- G.f.: 1/((1-x)*(1-x^2)*(1-x^3)^2*(1-x^4)*(1-x^5)).at n=49A003402
- Expansion of 1/((1-6x)(1-9x)(1-10x)(1-11x)).at n=3A028216
- Number of bipartite graphs with 5 edges on nodes {1..n}.at n=7A053528
- Numbers k that, when expressed in base 6 and then interpreted in base 7, give a multiple of k.at n=13A062934
- A014486-encoding of the "Moose trees".at n=2A080973
- A014486-encodings of trivalent plane trees (tpt) represented as (embedded into) a subset of general plane trees.at n=6A083936
- Triangle read by rows: a(n,k) = number of paths of n upsteps U and n downsteps D that contain k UDUs.at n=39A097692
- G.f. satisfies: A(x) = 1/(1 + x*A(x^4)) and also the continued fraction: 1 + x*A(x^5) = [1; 1/x, 1/x^4, 1/x^16, 1/x^64, ..., 1/x^(4^(n-1)), ...].at n=62A101914
- Triangle read by rows: T(n,k) is number of labeled bipartite graphs with n nodes and k edges.at n=34A117279
- a(n) = ceiling((Pi+e)^(n*e)).at n=2A121917
- Coefficients of the v=2 member of a family of certain orthogonal polynomials.at n=42A129462
- a(n) = (sum of first n primes) * n.at n=20A167214
- Numbers n such that sigma(lambda(n)) = lambda(sigma(n)).at n=33A173942
- Smallest number k such that k^n is the sum of numbers in a twin prime pair.at n=17A195336
- The Szeged index of the n-sunlet graph (n>=3).at n=21A228600
- Number of (n+1)X(1+1) 0..2 arrays colored with the sum of the upper and lower median values of each 2X2 subblock.at n=3A236349
- Number of (n+1)X(4+1) 0..2 arrays colored with the sum of the upper and lower median values of each 2X2 subblock.at n=0A236352
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays colored with the sum of the upper and lower median values of each 2X2 subblock.at n=6A236354
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays colored with the sum of the upper and lower median values of each 2X2 subblock.at n=9A236354
- Expansion of Sum_{i>=0} x^(2^i)/(1 - x^(2^i)) / Product_{j>=0} (1 - x^(2^j)).at n=48A281688