13938
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 29376
- Proper Divisor Sum (Aliquot Sum)
- 15438
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4400
- Möbius Function
- 1
- Radical
- 13938
- Omega Function (Ω)
- 4
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 58
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- yes
- 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
- Coordination sequence for Cr3Si, Si position.at n=30A009927
- a(n) = Sum_{1<=k<=n, gcd(k,n)=1} Fibonacci(k).at n=20A070964
- a(n) is the smallest number x such that gcd(prime(x)+1,x+1) = n.at n=52A084316
- a(0) = 0, a(1) = 1 and for n >= 2, a(n) = floor(sqrt(2 * (a(n-2)^2 + a(n-1)^2))).at n=21A093332
- Structured tetragonal anti-prism numbers.at n=22A100182
- Number of n X n binary arrays symmetric under horizontal and vertical reflection with all ones connected only in a 0110-1111-0110 pattern in any orientation.at n=16A146919
- a(n) = 1*4*7 + 4*7*10 + 7*10*13 + ... (n terms).at n=6A196513
- Numbers n such that n^8 + 1 and (n + 2)^8 + 1 are both prime.at n=33A217972
- Number of partitions p of n such that (number of numbers of the form 3k+1 in p) is a part of p.at n=37A241547
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 493", based on the 5-celled von Neumann neighborhood.at n=26A272545
- a(n) = 3*(n+1)*(9*n+4).at n=22A304503
- Largest number whose base-n expansion cannot be subdivided to form a sequence of numbers which ordered form a multiple of n+1 when using +, *, and ().at n=9A330671
- a(n) = Sum_{k=0..floor(n/2)} binomial(k+2,2) * binomial(k,3*(n-2*k)).at n=22A392255