13113
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 9
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 19968
- Proper Divisor Sum (Aliquot Sum)
- 6855
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8280
- Möbius Function
- 0
- Radical
- 4371
- Omega Function (Ω)
- 4
- 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
- 169
- 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
- no
- Odd
- yes
Appears in sequences
- Number of phylogenetic trees with n labels.at n=6A005805
- Number of independent polynomial invariants of matrix of order n.at n=10A007718
- Numbers having only digits 1 and 3 in their decimal representation.at n=39A032917
- Numbers with multiplicative digital root value 9.at n=26A034056
- Nonprimes whose sum of digits is equal to its product of digits.at n=35A066307
- Numbers with at least 2 distinct digits and whose "rotations" (including the number itself) are multiples of these digits; repeated digits allowed but digit 0 not allowed.at n=15A066484
- Smallest multiple of n that begins with the concatenation of the divisors of n (in increasing order).at n=30A078218
- (n / product of digits of n) is a semiprime.at n=31A085773
- Concatenations of pairs of primes that differ by 100.at n=2A103523
- Let n = a_1a_2...a_k, where the a_i are digits. a(n) = least multiple of n of the type b_1a_1b_2a_2...a_kb_{k+1}, obtained by inserting single digits b_i in the gaps and both ends; 0 if no such number exists.at n=30A110735
- Lucky numbers for which both the sum of the digits and the product of the digits is also a lucky number.at n=23A118559
- Describe prime factorization of n (primes in ascending order and with repetition) (method A - initial term is 2).at n=37A123132
- a(n) = 2*3^n - n - 1.at n=8A132308
- G.f.: A(x) = Sum_{n>=0} (-1)^n * log(1 - x - 2^n*x^2)^n / n! .at n=8A136508
- Concatenation of n and a list of the divisors of n.at n=12A137464
- a(1)=1, a(n) = a(n-1) + n^3 if n odd, a(n) = a(n-1) + n^1 if n is even.at n=16A140153
- 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, -1, 1), (-1, 1, 1), (0, 0, -1), (1, 0, 0)}.at n=10A148239
- Triangle T(n, k, m) = (m*(n-k) + 1)*T(n-1, k-1, m) + (m*k + 1)*T(n-1, k, m) - m*f(n,k)*T(n-2, k-1, m) with T(n, 0, m) = T(n, n, m) = 1, f(n, k) = k if k <= floor(n/2) otherwise n-k, and m = 2, read by rows.at n=46A157211
- Triangle T(n, k, m) = (m*(n-k) + 1)*T(n-1, k-1, m) + (m*k + 1)*T(n-1, k, m) - m*f(n,k)*T(n-2, k-1, m) with T(n, 0, m) = T(n, n, m) = 1, f(n, k) = k if k <= floor(n/2) otherwise n-k, and m = 2, read by rows.at n=53A157211
- a(n) = n*(14*n - 11).at n=31A195021