13712
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
- 2
Divisibility
- Divisor Count
- 10
- Divisor Sum
- 26598
- Proper Divisor Sum (Aliquot Sum)
- 12886
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6848
- Möbius Function
- 0
- Radical
- 1714
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 2
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
- 32
- 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 a modular function.at n=21A006709
- Minimal elements of pairs of "Super Unitary Amicable Numbers", sorted by their minimal elements.at n=34A045613
- Number of inequivalent (ordered) solutions to n^2 = sum of 7 squares of integers >= 0.at n=48A065461
- a(0)=2. For n>=1, a(n) = a(n-1) + n if a(n-1) is composite; a(n) = a(n-1)*n if a(n-1) is prime.at n=16A131199
- Number of Section I primes between 2^n and 2^(n+1). See A135832.at n=40A135833
- A triangle related to the a(n) formulas for the rows of the ED2 array A167560.at n=32A167565
- The fifth left hand column of triangle A167565.at n=3A168304
- Number of nX4 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 0,3,1,1,1 for x=0,1,2,3,4.at n=7A197619
- T(n,k)=Number of nXk 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 0,3,1,1,1 for x=0,1,2,3,4.at n=58A197623
- T(n,k)=Number of nXk 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 0,3,1,1,1 for x=0,1,2,3,4.at n=62A197623
- Number of 0..n arrays x(0..11) of 12 elements with zero 6th differences.at n=38A200374
- Floor(M(g(n-1)+1,..,g(n))), where M = harmonic mean and g(n) = n(n + 1)(n + 2)/6.at n=42A227016
- Row sums of triangle A245618.at n=19A245619
- Expansion of 4*x^2/(1 - x - 9*x^2 + x^3).at n=9A271945
- Number of n X 5 0..1 arrays with every element equal to 0, 1, 3 or 4 horizontally or antidiagonally adjacent elements, with upper left element zero.at n=5A302078
- T(n,k) = Number of n X k 0..1 arrays with every element equal to 0, 1, 3 or 4 horizontally or antidiagonally adjacent elements, with upper left element zero.at n=50A302081
- Number of 6Xn 0..1 arrays with every element equal to 0, 1, 3 or 4 horizontally or antidiagonally adjacent elements, with upper left element zero.at n=4A302085
- G.f.: x * Product_{j>=1, k>=1} ((1 + x^(j*k))/(1 - x^(j*k)))^a(j).at n=7A308152
- Number of nXn 0..1 arrays with every element unequal to 0, 2 or 3 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=7A317808
- Number of inequivalent vertex colorings of graphs on n unlabeled vertices.at n=6A340024