11830
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 26352
- Proper Divisor Sum (Aliquot Sum)
- 14522
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3744
- Möbius Function
- 0
- Radical
- 910
- 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
- Expansion of 1/((1-x)*(1-9*x)*(1-10*x)*(1-12*x)).at n=3A025031
- Numbers n such that n divides the (right) concatenation of all numbers <= n written in base 8 (most significant digit on right).at n=13A029501
- Number of reversible strings with n-1 beads of 2 colors. 4 beads are black. String is not palindromic.at n=24A032091
- Number of partitions in parts not of the form 17k, 17k+1 or 17k-1. Also number of partitions with no part of size 1 and differences between parts at distance 7 are greater than 1.at n=44A035962
- Numbers k that, when expressed in base 5 and then interpreted in base 7, give a multiple of k.at n=9A062929
- Unitary weird numbers: unitary abundant (A034683) but not unitary pseudoperfect (A293188).at n=9A064114
- Nonsquares with A072594(n) = 0.at n=25A072596
- Numbers n such that sopf(phi(n)) = phi(sopf(n)), where sopf(x) = sum of the distinct prime factors of x.at n=38A076531
- Number of distinct factorizations of n! with all factors > 1.at n=8A076716
- This table shows the coefficients of combinatorial formulas needed for generating the sequential sums of p-th powers of binomial coefficients C(n,5). The p-th row (p>=1) contains a(i,p) for i=1 to 5*p-4, where a(i,p) satisfies Sum_{i=1..n} C(i+4,5)^p = 6 * C(n+5,6) * Sum_{i=1..5*p-4} a(i,p) * C(n-1,i-1)/(i+5).at n=14A087109
- a(n) = 2*a(n-1) + 2*a(n-3) + a(n-4), with a(0)=1, a(1)=2, a(3)=4, a(4)=10.at n=11A089928
- Let f(x)=(largest digit of x)^(smallest digit of x) + x (A097385). Sequence gives numbers n such that f(n) and f(n+1) are both prime.at n=27A097387
- 2*A084158 (twice Pell triangles).at n=6A114620
- Row sums of correlation triangle for floor((n+4)/4).at n=49A115269
- Triangle T(n,k), 0 <= k <= n, defined by : T(n,k) = 0 if k < 0, T(0,k) = 0^k, (n+2)*(2*n-2*k+1)*T(n,k) = (2*n+1)*( 4*(2*n-2*k+1)*T(n-1,k-1) + (n+2*k+2)*T(n-1,k) ).at n=30A123382
- Even almost practical numbers.at n=40A174534
- a(1)=1. For n >= 2, a(n) = 2*a(n-1) + (number of composites among first n-1 terms of the sequence).at n=13A175104
- Numbers n such that 6n and 12n are both the average of twin prime pairs.at n=20A177680
- a(n) = 31*binomial(2*n,n-4) + Sum_{i=1..n-4} binomial(2*n,n-4-i)*(4+i).at n=7A182025
- Total Wiener index of double-star trees with n nodes.at n=25A186235