13244
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 29568
- Proper Divisor Sum (Aliquot Sum)
- 16324
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5040
- Möbius Function
- 0
- Radical
- 6622
- Omega Function (Ω)
- 5
- 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
- yes
- Pell Number
- no
- Tribonacci Number
- no
- Pronic Number
- no
Recreational
- Happy Number
- no
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 169
- 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
- Tetrahedral (or triangular pyramidal) numbers: a(n) = C(n+2,3) = n*(n+1)*(n+2)/6.at n=42A000292
- Sum of the first n even squares: a(n) = 2*n*(n+1)*(2*n+1)/3.at n=21A002492
- Binomial coefficient C(4n,n-8).at n=3A004338
- a(n) = Sum_{k=1..n-1} lcm(k,n-k).at n=43A006580
- Binomial coefficient C(44,n).at n=3A010960
- a(n) = binomial coefficient C(n,41).at n=3A010994
- Even tetrahedral numbers.at n=31A015220
- Convolution of Fibonacci numbers and primes.at n=15A023615
- a(n) = self-convolution of row n of Catalan triangle (A008315).at n=10A027301
- a(n) = (prime(n) - 1)*(prime(n) - 3)*(prime(n) - 5)/48.at n=22A030004
- Least term in period of continued fraction for sqrt(n) is 8.at n=31A031432
- T(n,3), array T as in A050186; a count of aperiodic binary words.at n=41A050188
- a(n) = Sum_{k = 1..n, gcd(k,n)=1} k*(n-k).at n=42A057789
- a(n) = Sum_{1<=k<=n, gcd(k,n)=1}, A000217(k).at n=42A127415
- 1/6 of product of three numbers: n-th prime, previous and following number.at n=13A127920
- Tetrahedral numbers k*(k+1)*(k+2)/6 such that exactly one of k, k+1, and k+2 is prime.at n=24A144521
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, -1), (-1, -1, 0), (-1, -1, 1), (0, 1, 0), (1, 0, 0)}.at n=9A149838
- 14 times triangular numbers.at n=43A163756
- Row sums of A168281.at n=41A168380
- Least m>0 such that prime(n) divides S(m)=A007908(m)=123...m and all numbers obtained by cyclic permutations of its digits; 0 if no such m exists.at n=26A181373