13192
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
- 3
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 26460
- Proper Divisor Sum (Aliquot Sum)
- 13268
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 6144
- Möbius Function
- 0
- Radical
- 3298
- Omega Function (Ω)
- 5
- 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
- 32
- 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 4-dimensional cubic lattice (points on surface of 4-dimensional cross-polytope).at n=17A008412
- Expansion of tanh(x)/cosh(log(1+x)).at n=9A009842
- a(n) = n*(n-1)*(n^2 + 2)/6.at n=17A071244
- Reverse of largest prime factor of n = smallest prime factor of n+1; a(1)=1.at n=12A071393
- Numbers k such that k + sigma(k) + phi(k) is a square.at n=19A116009
- Numbers n such that sigma(lambda(n)) = lambda(sigma(n)).at n=31A173942
- Those positive integers n where, when written in binary, there are exactly k number of runs (of either 0's or 1's) each of exactly k length, for all k where 1<=k<=m, for some positive integer m.at n=27A175356
- Triangle read by rows: T(n,k) is the number of 2-compositions of n having k columns with an even sum (0<=k<=floor(n/2)).at n=26A181327
- The number of ways to color the vertices of all (11) simple unlabeled graphs on 4 nodes using at most n colors.at n=7A199394
- Sigma(n) values in A115920.at n=19A216372
- Expansion of x*log'(((1-sqrt(1-4*x))/2-sqrt(((-sqrt(1-4*x)-11)*(1-sqrt(1-4*x)))/4+1)+1)/4).at n=6A243644
- Sequences n*(n+1)*(6*n+1)/2 and n*(n+1)*(7*n+1)/2 interleaved.at n=31A296636
- a(1) = 1; a(n+1) is the smallest k > a(n) such that 2^k == 2^a(n) (mod a(n)).at n=42A306829
- a(n) is the number of partitions of 72*n + 42 into 10 odd squares.at n=35A323891
- Let D = A042948(n) be the n-th positive integer congruent to 0 or 1 mod 4, then a(n) = b(D) := Sum_{i=1..D} Kronecker(D,i)*i^2, where Kronecker(D,i) is the Kronecker symbol.at n=48A329649
- Number of integer partitions of n whose first differences (assuming the last part is zero) are not unimodal.at n=35A332284
- Fill an infinite square array by following a spiral around the origin; in the central cell enter a(0)=1; thereafter, in the n-th cell, enter the sum of the entries of those earlier cells that are in the same row or column as that cell.at n=20A334741
- Infinitary Zumkeller numbers (A335197) whose set of infinitary divisors can be partitioned into two disjoint sets of equal sum in a single way.at n=37A335199
- Abundant pseudoperfect numbers k such that no subset of the nontrivial divisors {d|k : 1 < d < k} sums to k.at n=44A339343
- a(n) = Sum_{i+j<=m+1} t_i * t_j, where t_1 < ... < t_m are the totatives of n.at n=33A341063