13224
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
- 3
Divisibility
- Divisor Count
- 32
- Divisor Sum
- 36000
- Proper Divisor Sum (Aliquot Sum)
- 22776
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4032
- Möbius Function
- 0
- Radical
- 3306
- Omega Function (Ω)
- 6
- Little Omega Function (ω)
- 4
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
- 94
- 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 k such that k + sum of its prime factors = (k+1) + sum of its prime factors.at n=22A020700
- Numbers k such that k concatenated with k+1 is a square.at n=5A030465
- A simple grammar: pairs of cycles of sequences.at n=15A052821
- a(n) = (2*n-1)*(13*n^2-13*n+6)/6.at n=14A063493
- a(0)=1, a(n) = 8*n*(2*n-1).at n=29A067239
- Numbers k such that sigma(k^2-k-1) = k*(k+1).at n=23A069826
- Numbers n such that zero is never reached by iterating the mapping k -> abs(reverse(lpd(k))-reverse(gpf(k))). lpd(k) is the largest proper divisor and gpf(k) is the largest prime factor of k.at n=36A076425
- Numbers k that have no zero digits and such that both k+1 and (product of digits of k) + 1 are squares.at n=14A081990
- Least positive integer coefficients of power series A(x) such that the coefficients of A(x)^2 + A(x) - 1 consist entirely of squares.at n=81A083352
- Number of distinct products of subsets of integers in the interval [n^2+1, (n+1)^2-1] which are twice a square.at n=49A099500
- Numbers k such that k concatenated with k-8 gives the product of two numbers which differ by 6.at n=13A116106
- Numbers k such that k concatenated with k-3 gives the product of two numbers which differ by 4.at n=9A116136
- Numbers k such that the central binomial coefficient C(2k,k) is divisible by k^2.at n=26A121943
- a(n) = n^3 - n^2 - n.at n=24A152015
- Eight times hexagonal numbers: a(n) = 8*n*(2*n-1).at n=29A152750
- a(n) = 529*n - 1.at n=24A158365
- Monotonic ordering of nonnegative differences 5^i-7^j, for 40>= i>=0, j>=0.at n=16A192195
- Number of 5-length words w over n-ary alphabet such that for every prefix z of w we have #(z,a_i) = 0 or #(z,a_i) >= #(z,a_j) for all j>i and #(z,a_i) counts the occurrences of the i-th letter in z.at n=8A213284
- Number of n-length words w over 8-ary alphabet such that for every prefix z of w we have #(z,a_i) = 0 or #(z,a_i) >= #(z,a_j) for all j>i and #(z,a_i) counts the occurrences of the i-th letter in z.at n=5A213296
- a(n) = A(n)*7^(-floor(n+1)/3), where A(n) = 7*A(n-1) - 14*A(n-2) + 7*A(n-3) with A(0)=0, A(1)=1, A(2)=7.at n=13A217444