13944
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 32
- Divisor Sum
- 40320
- Proper Divisor Sum (Aliquot Sum)
- 26376
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3936
- Möbius Function
- 0
- Radical
- 3486
- 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
- 182
- 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
- Aliquot sequence starting at 564.at n=7A014361
- Molien series for group G_{1,2}^{8} of order 1536.at n=31A051462
- Expansion of (1+x^2)*(1+x^5)/( Product_{j=1..7} (1-x^j) ).at n=38A060962
- a(n) = lcm(p-1, p+1) where p is the n-th prime.at n=38A084921
- Numbers k such that 7*10^k + 8*R_k - 5 is prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=10A103066
- E.g.f. (arcsinh(1/sinh(arcsinh(1) - sqrt(2)*x)) - arcsinh(1))/sqrt(2).at n=7A104018
- a(n) = (n+1)*(n+2)^2*(n+3)*(n+4)*(4*n^2+15*n+15)/720.at n=6A108682
- a(1)=1, a(n) = first index i (> a(n-1)), where A112046(i) gets a value distinct from any values A112046(1)..A112046(a(n-1)).at n=38A112051
- Number of partitions of n with at most 3 odd parts.at n=43A114312
- Numbers k such that k^2 divides 2*Fibonacci(k).at n=8A130163
- 12 times pentagonal numbers: a(n) = 6*n*(3*n-1).at n=28A153792
- Integers n such that 17+30*n are terms in A172456.at n=12A175103
- a(n) = a(n-1) + floor(a(n-2)/3) with a(0)=2, a(1)=3.at n=39A182229
- Number of -n..n arrays x(0..6) of 7 elements with zero sum and no two consecutive declines, no adjacent equal elements, and no element more than one greater than the previous (random base sawtooth pattern).at n=28A200185
- a(n) = (prime(n)^2 - 1)/2 for n >= 2.at n=37A216244
- 4-step Fibonacci sequence starting with 1,1,0,0.at n=18A251703
- Irregular triangle read by rows: T(n,k) is the number of necklaces of n 1's, n -1's, and k 0's such that no two adjacent elements are equal.at n=60A283615
- Least integer k such that the area of the triangle (prime(n), k, k+1) is an integer.at n=37A286328
- Colombian numbers that are also Bogotá numbers.at n=35A336984
- a(n) is the Pisano period of prime(n)^2.at n=22A343116