11430
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 9
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 29952
- Proper Divisor Sum (Aliquot Sum)
- 18522
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3024
- Möbius Function
- 0
- Radical
- 3810
- Omega Function (Ω)
- 5
- 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
- 174
- 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 labeled trees of diameter 3 with n nodes.at n=6A000554
- Triangle giving number of labeled trees with n >= 3 nodes and diameter d >= 2.at n=29A034854
- Number of partitions of n with equal nonzero number of parts congruent to each of 0 and 3 (mod 5).at n=45A035564
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2*n - 3 - 2^(p+1) and 2^p < n - 1 <= 2^(p+1), starting with a(1) = a(2) = 1 and a(3) = 4.at n=41A050036
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 2, and a(3) = 4.at n=41A050052
- a(n) = a(n-1) + a(m) for n >= 3, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1 and a(2) = 3.at n=41A050068
- Triangle T(n,k) read by rows: number of labeled trees with n nodes and k leaves, n >= 2, 2 <= k <= n.at n=42A055314
- Number of labeled trees with n nodes and 8 leaves.at n=1A055320
- Eighth column (k=7) of septinomial array A063265.at n=8A063267
- a(n) = (2*n-1)*(n^2 -n +2)/2.at n=22A063488
- G.f.: (1-8*x-sqrt(64*x^2-20*x+1))/(2*x).at n=4A082367
- Indices of primes in sequence defined by A(0) = 71, A(n) = 10*A(n-1) + 21 for n > 0.at n=21A101137
- A Chebyshev-related transform of the Fibonacci numbers.at n=14A112576
- A triangular sequence of coefficients based on the expansion of a Morse potential type function: p(x,t) = exp(x*t)*(exp(-2*t) - 2*exp(-t)).at n=57A138106
- Row sums of triangle A143102.at n=31A143103
- 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, 0, 1), (-1, 1, 1), (1, 0, -1), (1, 0, 1)}.at n=8A149304
- Half the number of length n integer sequences with sum zero and sum of squares 2888.at n=3A157570
- a(0)=1, a(1)=5, a(n)=11*a(n-1)-25*a(n-2) for n>1.at n=5A165312
- Sum of digits of square is sum of square of digits.at n=32A165550
- Numbers k such that k^2 +-11 are primes.at n=36A176683