13377
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 22400
- Proper Divisor Sum (Aliquot Sum)
- 9023
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7056
- Möbius Function
- 0
- Radical
- 273
- 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
- 45
- 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
- MacMahon's solid partitions of n in which 3 is the smallest summand.at n=12A002044
- Numbers k that divide s(k), where s(1)=1, s(j)=9*s(j-1)+j.at n=42A014857
- Positive numbers k such that k and 5*k are anagrams in base 8 (written in base 8).at n=11A023076
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 76.at n=37A031574
- a(n) = binomial(n+4,4)*(4*n+5)/5.at n=11A034263
- Composite numbers k such that digits in k and in juxtaposition of prime factors of k are the same (apart from multiplicity).at n=32A035141
- G.f.: 1/((1-x)*(1-x^2))^3.at n=22A038163
- 20-gonal (or icosagonal) numbers: a(n) = n*(9*n-8).at n=39A051872
- Expansion of (1-x)^(-1)/(1+2*x-2*x^2).at n=10A077917
- Visible factor numbers (VFNs): composite numbers k with the property that every prime factor of k can be found in the decimal expansion of k and every digit of k can be covered by a prime factor.at n=2A083359
- Subsequence of sequence A083359 in which factors do not overlap in the number.at n=2A083360
- Number of forests with two connected components in the complete graph K_{n}.at n=6A083483
- Given the 3 X 3 matrix M = [0 1 0 / 0 0 1 / 7 -14 7], a(n) = (-) rightmost term of M^n * [1 1 1].at n=6A094429
- Triangle read by rows: T(n, m) = number of forests with n nodes and m labeled trees. Also number of forests with exactly n - m edges on n labeled nodes.at n=22A105599
- a(0) = 0, a(1) = 1, a(2) = 1, a(3) = 2, a(4) = 4, for n>3: a(n+1) = SORT[a(n) + a(n-1) + a(n-2) + a(n-3)], where SORT places digits in ascending order and deletes 0's.at n=42A108564
- Numbers for which the sum of the digits is the square root of the product of their digits.at n=28A117720
- Number of tilings of a 2 X n board with 1 X 1 and L-shaped tiles (where the L-shaped tiles cover 3 squares).at n=10A127864
- Triangle read by rows: T(n, k) is the number of forests on n labeled nodes with k edges. T(n, k) for n >= 1 and 0 <= k <= n-1.at n=26A138464
- Numbers k which are concatenations k=x//y such that x^2 + y^2 - x*y = k.at n=27A162556
- a(n) is the smallest nonnegative number whose American English name has the letter "n" in the n-th position.at n=39A164791