13152
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 34776
- Proper Divisor Sum (Aliquot Sum)
- 21624
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4352
- Möbius Function
- 0
- Radical
- 822
- Omega Function (Ω)
- 7
- 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
- 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
- Expansion of 1/((1-x)^3 (1-x^2)^2 (1-x^3) (1-x^4)).at n=21A002626
- Shifts 6 places right under inverse binomial transform.at n=14A010750
- a(n) = a(n-1) + a(n-2) + 1, with a(0) = 1 and a(1) = 6.at n=17A022320
- 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 57.at n=30A031555
- Expansion of (1-2*x)/(1-4*x-2*x^2+4*x^3).at n=7A052978
- Number of optimal binary prefix-free codes with n words all ending in 1.at n=41A055167
- McKay-Thompson series of class 39C for Monster.at n=47A058661
- Numbers k such that prime(k+3)-(k+3)*tau(k+3) = prime(k-3)-(k-3)*tau(k-3) where tau(k) = A000005(k) is the number of divisors of k.at n=30A067355
- a(n) = n!*Sum_{k=1..n} mu(k)/k!, where mu(k) is the Moebius function.at n=7A068107
- 2^(n-3)n(9n^2-9n+4).at n=6A086604
- McKay-Thompson series of class 39C for the Monster group with a(0) = 1.at n=47A094362
- Triangle T(n, k) = n! * StirlingS1(n, k)/binomial(n, k), read by rows.at n=16A142473
- a(n) is the number of n-tosses having a run of 6 or more heads for a fair coin (i.e., probability is a(n)/2^n).at n=17A143662
- a(n) = nonnegative value y such that (A155135(n), y) is a solution to the Diophantine equation x^3+28*x^2 = y^2.at n=25A155137
- a(n) = nonnegative value y such that (A155136(n), y) is a solution to the Diophantine equation x^3+28*x^2 = y^2.at n=24A155138
- Number of permutations of 3..n+2 with no element divisible by an adjacent element.at n=7A178846
- Number of ways to reciprocally link elements of an n X 7 array either to themselves or to exactly one king-move neighbor.at n=2A220643
- T(n,k) = number of ways to reciprocally link elements of an n X k array either to themselves or to exactly one king-move neighbor.at n=29A220644
- T(n,k) = number of ways to reciprocally link elements of an n X k array either to themselves or to exactly one king-move neighbor.at n=34A220644
- Number of nX1 0..2 arrays with no more than floor(nX1/2) elements equal to at least one horizontal or vertical neighbor, with new values introduced in row major 0..2 order.at n=10A222848