13112
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 8
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 27000
- Proper Divisor Sum (Aliquot Sum)
- 13888
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5920
- Möbius Function
- 0
- Radical
- 3278
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 107
- 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
- Numbers k such that sopf(k) = 2*sopf(k+1), where sopf(k) = A008472.at n=20A064112
- Number of subsets of {1,2,3,...,n} that sum to 0 mod 5.at n=16A068011
- Multiples of 8 with digit sum 8.at n=38A069543
- Array in which the n-th row contains the multiples of n using nonzero digits and having a digit sum of n. Sequence contains the rows and a zero entry for rows with no terms (e.g. 10).at n=37A077755
- Numbers k such that (k / sum of digits of k) and (k+1 / sum of digits of k+1) are both semiprime.at n=23A085774
- E.g.f. exp(x)*BesselI(1,2*sqrt(3)*x)/sqrt(3).at n=8A098519
- Number of n X n binary arrays symmetric about main diagonal with all ones connected only in a 3X3 plus 2,1 2,2 2,3 1,2 3,2.at n=10A146000
- Number of n X n binary arrays symmetric about the diagonal and under 90-degree rotation with all ones connected only in a 3 X 3 "plus" shape (e.g., consisting of the points at the coordinates (2,1), (2,2), (2,3), (1,2), (3,2)).at n=23A146002
- A156977/3.at n=11A164565
- Number of nX2 1..4 arrays containing at least one of each value, all equal values connected, rows considered as a single number in nondecreasing order, and columns considered as a single number in nondecreasing order.at n=8A166797
- Number of permutations of 0..(n-1) representable as consecutive sums of 8 adjacent elements of a sequence of n+7 nonnegative integers.at n=13A180211
- Numbers whose product of digits is 6.at n=42A199988
- Composite numbers whose product of digits is 6.at n=28A201055
- Numbers that eventually reach 1 under "x -> sum of 4th power of digits of x".at n=14A219111
- Numbers k such that 27*k+1 is a square.at n=44A219258
- Sum of the denominators of the Farey series of order n (A006843).at n=40A240877
- The binomial sum a(n) = Sum_{k=0..n}(binomial(n,k)*binomial(n+1,k+1)*binomial(n+2,k+2)).at n=5A277188
- Number of n X 1 0..1 arrays with the number of 1's king-move adjacent to some 0 two less than the number of 0's adjacent to some 1.at n=17A286209
- Least number k such that the determinant of the symmetric Hankel matrix formed by its decimal digits is equal to n.at n=30A308110
- a(n) is the smallest m > n such that n^2*(n^2 + 1) divides m^2*(m^2 + 1).at n=43A308935