13768
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 25830
- Proper Divisor Sum (Aliquot Sum)
- 12062
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6880
- Möbius Function
- 0
- Radical
- 3442
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 2
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
- 58
- 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
- Coordination sequence for MgCu2, Mg position.at n=29A009931
- Quadruples of different integers from [ 1,n ] with no common factors between pairs.at n=40A015623
- Number of nonisomorphic unrooted unicursal planar maps with n edges and two vertices of valency 1 (unicursal means that exactly two vertices are of odd valency; there is an Eulerian path).at n=7A069725
- Triangle T, read by rows, that satisfies the recurrence: T(n,k) = [T^3](n-1,k-1) + [T^3](n-1,k) for n>k>=0, with T(n,n)=1 for n>=0, where T^3 is the matrix third power of T.at n=17A113084
- Related to enumeration of free catapolyoctagons (see Cyvin reference for precise definition).at n=6A121121
- Number of planar n X n X n binary triangular grids with no more than 2 ones in any 3 X 3 X 3 subtriangle.at n=6A153523
- E.g.f. arctan(log(1+tanh(x))).at n=8A191995
- Number of (w,x,y) with all terms in {0,...,n} and w<x+y and x<=y.at n=31A212982
- Number of 2 X n arrays of the minimum value of corresponding elements and their horizontal or vertical neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..3 2 X n array.at n=13A219579
- a(n) = floor(M(g(n-1)+1,..,g(n))), where M = harmonic mean and g(n) = n*(n + 1)*(n + 2)*(n + 3)/24.at n=22A227018
- Number of partitions of n having depth 1; see Comments.at n=36A237685
- Number of length 3 0..n arrays with each partial sum starting from the beginning no more than one standard deviation from its mean.at n=32A244791
- Numbers n such that A242719(n) = (prime(n))^2+1 and A242720(n) - A242719(n) = 2*(prime(n)+1).at n=17A246748
- Number of (n+1) X (3+1) 0..1 arrays with every 2 X 2 subblock antidiagonal maximum minus diagonal minimum nondecreasing horizontally and diagonal maximum minus antidiagonal minimum nondecreasing vertically.at n=42A253392
- a(n) = A001235(n) - floor(A001235(n)^(1/3))^3.at n=41A273555
- Partial sums of A301692.at n=90A301693
- Number of partitions of n into 6 or more parts.at n=29A347542
- Triangular array read by rows: T(n, k) = number of occurrences of 2k as a sum |1 - p(1)| + |2 - p(2)| + ... + |n - p(n)|, where (p(1), p(2), ..., p(n)) ranges through the permutations of (1,2,...,n), for n >= 1, 0 <= k <= n-1.at n=52A357329
- The second moment of an n X n symmetric random +-1 matrix.at n=7A362413
- Number of subsets of {1..n} containing n such that it is possible to choose a different binary index of each element.at n=26A370639