13162
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
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 19746
- Proper Divisor Sum (Aliquot Sum)
- 6584
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6580
- Möbius Function
- 1
- Radical
- 13162
- Omega Function (Ω)
- 2
- 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
- 138
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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)/32 ).at n=27A011942
- Numbers k such that the continued fraction for sqrt(k) has period 83.at n=8A020422
- a(n) = Sum_{k=0..n-1} T(n,k) * T(n,k+1), with T given by A026300.at n=5A026940
- Third column of A071223.at n=14A087645
- Solution to the non-squashing boxes problem (version 2).at n=29A089055
- Molien series for complete weight enumerators of Hermitian self-dual codes over the Galois ring GR(4,2).at n=10A099757
- a(n) = 2*a(n-1) - a(n-2) + n + 1.at n=41A121968
- a(n) = 8*n^2 - 7*n + 1.at n=41A125201
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 0, 0), (0, 0, 1), (0, 1, -1), (1, 0, 0)}.at n=8A150062
- Numbers k that are the products of two distinct primes such that 2*k-1, 4*k-3, 8*k-7, 16*k-15 and 32*k-31 are also products of two distinct primes.at n=21A177214
- Number of 5 X n arrays of the minimum value of corresponding elements and their horizontal or diagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..1 5 X n array.at n=22A220035
- Expansion of (A(x)^2+A(x^2))/2 where A(x) = A001006(x).at n=11A275207
- Expansion of (A(x)^2-A(x^2))/2 where A(x) = A001006(x).at n=11A275208