13082
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
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 20352
- Proper Divisor Sum (Aliquot Sum)
- 7270
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6300
- Möbius Function
- -1
- Radical
- 13082
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 45
- 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
- Expansion of tan(sinh(log(1+x))).at n=7A009676
- Near-Bell numbers: partitions of an n-multiset with multiplicities 1, 1, 1, ..., 1, 2.at n=8A035098
- a(n) is twice the smallest k such that A051686(k) = prime(n).at n=25A051692
- Twice the positions in A051686 at which new primes appear in that sequence.at n=39A051861
- Numbers k such that k^128 + 1 is prime.at n=35A056994
- Let b(0)=1; b(1)=1; b(n+2) = (Pi^2/6 + 6/Pi^2)*b(n+1) - b(n). a(n) = floor(b(n)).at n=19A093607
- Table T(n,k) read by rows which contains in row n and column k the sum of A001055(A036035(n,j)) over all column indices j where A036035(n,j) has k distinct prime factors.at n=43A093936
- Triangular array t read by rows: t(0,k) is p(k), the number of partitions of the k-multiset {0,0,...,0} with k zeros. For 0 <= n < k, t(n, k) is the number of partitions of the k-multiset {0, 0, ..., 0, 1, 2, 3, ..., k-n} with n zeros.at n=43A126442
- Expansion of x/(1 - 4*x + 6*x^2 - 5*x^3 + 4*x^4 - 3*x^5).at n=15A144897
- Consider all Consecutive Integer Pythagorean quintuples (X, X+1, X+2, Z-1, Z) ordered by increasing Z; sequence gives Z values.at n=4A157085
- Number of binary sequences of length n having a conjugate at Hamming distance 2.at n=30A179674
- Number of length n+4 0..5 arrays with every five consecutive terms having four times some element equal to the sum of the remaining four.at n=14A249653
- Number of nonzero coefficients in the polynomial factor of the expression counting binomial coefficients with 2-adic valuation n.at n=11A275012
- Expansion of (Product_{k>0} (1 - x^(3*k)) / (1 - x^k))^3 in powers of x.at n=15A285927
- a(n) = 1 + Sum_{d|n, d > 1} d^2*a(n/d).at n=23A307607
- a(n) = Sum_{k=1..n} k^2*tau(k), where tau is A000005.at n=20A319085
- Array read by upwards antidiagonals: T(m,n) = number of set partitions of the multiset consisting of one copy each of x_1, x_2, ..., x_m, and two copies each of y_1, y_2, ..., y_n, for m >= 0, n >= 0.at n=37A322765
- For 1<=x<=n, 1<=y<=n with gcd(x,y)=1, write 1 = gcd(x,y) = u*x+v*y with u,v minimal; a(n) = m^2*s, where s is the population variance of the values of |v| and m is the number of such values.at n=11A345695
- Number A(n,k) of partitions of the (n+k)-multiset {0,...,0,1,2,...,k} with n 0's; square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=47A346426
- Number A(n,k) of partitions of the (n+k)-multiset {1,2,...,n,1,2,...,k}; square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=46A346500