13772
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 26376
- Proper Divisor Sum (Aliquot Sum)
- 12604
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6240
- Möbius Function
- 0
- Radical
- 6886
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 58
- 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
- Number of planted binary phylogenetic trees with n labels.at n=6A006679
- Base-9 palindromes that start with 2.at n=28A043029
- Number of asymmetric mobiles (circular rooted trees) with n nodes and 7 leaves.at n=6A055368
- Square array, read by antidiagonals, where column (k+1) equals the self-convolution of row k, with row 0 and column 0 consisting of all 1's.at n=50A093541
- Numbers n such that 3 and 5 do not divide swing(n) = A056040(n).at n=41A196748
- Number of arrays of 4 nondecreasing integers in -n..n with sum zero and equal numbers greater than zero and less than zero.at n=42A203292
- Number of (n+1) X (1+1) 0..1 arrays with every 2 X 2 subblock having one or two 1s.at n=7A251319
- T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with every 2X2 subblock having one or two 1s.at n=28A251326
- T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with every 2X2 subblock having one or two 1s.at n=35A251326
- Coordination sequence for (3,5,5) tiling of hyperbolic plane.at n=16A265076
- T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with no element plus any vertical neighbor equal to n-1.at n=23A265863
- Number of 3Xn arrays containing n copies of 0..3-1 with no element plus any vertical neighbor equal to 3-1.at n=4A265864
- Numbers n such that Bernoulli number B_{n} has denominator 690.at n=20A272186
- 5-untouchable numbers.at n=32A284187
- Number of 4 X n 0..1 arrays with every 1 horizontally or antidiagonally adjacent to 2 neighboring 1s.at n=11A297301
- Smallest positive number not in a random Fibonacci sequence of length n.at n=31A338517
- Smallest positive number not in a random Fibonacci sequence of length n.at n=32A338517
- Numbers k such that 1 is in the transitive closure of the map x -> A353313(x) when starting iterating from x=k.at n=48A353306
- G.f.: Sum_{k>=0} x^k * Product_{j=1..3*k} (1 + x^j).at n=50A385067