13282
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 20700
- Proper Divisor Sum (Aliquot Sum)
- 7418
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6384
- Möbius Function
- -1
- Radical
- 13282
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 94
- 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
- a(n) = floor(n*(n-1)*(n-2)*(n-3)/16).at n=23A011926
- Numbers k such that the continued fraction for sqrt(k) has period 39.at n=25A020378
- Even 10-gonal (or decagonal) numbers.at n=29A028994
- Composite numbers whose prime factors contain no digits other than 2 and 9.at n=35A036313
- Numbers k that divide 4^k + 3^k + 1.at n=6A057351
- The least k such that A063994(k) = Product_{primes p dividing k} gcd(p-1, k-1) = n, or 0 if there's no such k.at n=56A064234
- Sum of smallest parts (counted with multiplicity) of all partitions of n into odd parts.at n=42A092313
- After the first two terms, each subsequent term is the smallest integer that is an outlier of the previous dataset, based on the criterion of 3 sample standard deviations above the mean.at n=44A103231
- A linear recurrence sequence: a(n) = a(n-1) + a(n-3) + a(n-5) + a(n-6).at n=23A128429
- a(n) = A144453(n)/16.at n=57A146537
- 6n-1,6n+1, 6n+5, 6n+7 are all primes. That is they are adjacent pairs of twin primes.at n=32A178145
- Dispersion of A016873, (5k+2), by antidiagonals.at n=39A191704
- Constant term of the reduction by x^2 -> x+2 of the polynomial p(n,x) defined below in Comments.at n=12A192423
- Number of nX4 0..1 arrays with no element equal to exactly two horizontal and vertical neighbors, with new values 0..1 introduced in row major order.at n=7A240515
- T(n,k)=Number of nXk 0..1 arrays with no element equal to exactly two horizontal and vertical neighbors, with new values 0..1 introduced in row major order.at n=58A240519
- Bernoulli number B_{n} has denominator 354.at n=32A255684
- Products of three distinct primes p1, p2 and p3 (sphenic numbers) with p1<p2 and p3 is the concatenation of p1 with p2.at n=6A281592
- a(n) = 32*n^2 - 40*n + 10.at n=20A343578
- 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 |u| and m is the number of such values.at n=11A345694