13636
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 27328
- Proper Divisor Sum (Aliquot Sum)
- 13692
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 5832
- Möbius Function
- 0
- Radical
- 6818
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 138
- 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 that are the sum of 6 nonzero 8th powers.at n=15A003384
- Numbers k such that k | 12^k + 12.at n=25A015904
- Number of dyslexic rooted planar trees with n nodes where any 2 subtrees extending from the same node are different.at n=14A032066
- Numbers n such that 215*2^n-1 is prime.at n=21A050859
- Triangle T(n,k) read by rows: permutations on 123...n with one abc pattern and no aj pattern with j<=k, n>2, k<n-1.at n=29A084249
- Number of line segments connecting exactly 4 points in an n x n grid of points.at n=24A177720
- O.g.f.: exp( Sum_{n>=1} (sigma(2*n)-sigma(n))^2/2 * x^n/n ).at n=11A193538
- Number of (n+2) X 8 0..2 arrays with every 3 X 3 subblock having three equal elements in a row horizontally, vertically, diagonally or antidiagonally exactly three ways, and new values 0..2 introduced in row major order.at n=8A204282
- G.f. A(x) satisfies: A(x) = 1+x + x^2*[d/dx A(x)^4].at n=5A218224
- Triangle T(n,k) read by rows: T(n,k) = number of permutations on 123...n with exactly one abc pattern and no aj pattern with j<=k, for n>=0, 0<=k<=n.at n=57A228708
- Number of permutations p of [n] such that p(i) > p(i+1) iff i == 1 (mod 10).at n=15A250266
- 38-gonal numbers: a(n) = n*(18*n-17).at n=28A282850
- Numbers k such that k!6 + 9 is prime, where k!6 is the sextuple factorial number (A085158 ).at n=30A288154
- Number of maximal cliques in the n-triangular honeycomb queen graph.at n=36A289877
- Number of 3Xn 0..1 arrays with every element equal to 0, 1, 4 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.at n=13A302681
- Number of compositions of n into parts with distinct multiplicities and with exactly seven parts.at n=44A321777
- Number of unlabeled multigraphs with loops allowed and n edges covering three vertices.at n=21A327728
- Numbers k such that there exists i >= 1 such that k divides 3^3^i + 1.at n=51A367266