13970
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 27648
- Proper Divisor Sum (Aliquot Sum)
- 13678
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5040
- Möbius Function
- 1
- Radical
- 13970
- 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
- 107
- 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
- Numbers whose base-7 representation contains exactly four 5's.at n=15A043416
- Write the numbers from 1 to n^2 in a spiraling square; a(n) is the total of the sums of the two diagonals.at n=22A059924
- a(1)=1, a(n) is the smallest integer > a(n-1) such that the sum of elements of the simple continued fraction for S(n)=1/a(1)+1/a(2)+...+1/a(n) equals n*(n+1)/2 the n-th triangular number.at n=19A071184
- a(n) = 997*n + 1009.at n=13A100776
- Constant term in the reduction by (x^2 -> x + 1) of the polynomial p(n,x) given in Comments.at n=11A192878
- Number of 2Xn 0..3 arrays with no element equal to zero plus the sum of elements to its left or one plus the sum of the elements above it or one plus the sum of the elements diagonally to its northwest or zero plus the sum of the elements antidiagonally to its northeast, modulo 4.at n=14A241357
- T(n,k)=Number of length n+4 0..k arrays with every five consecutive terms having two times the sum of some three elements equal to three times the sum of the remaining two.at n=36A248987
- Number of length 1+4 0..n arrays with every five consecutive terms having two times the sum of some three elements equal to three times the sum of the remaining two.at n=8A248988
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 182", based on the 5-celled von Neumann neighborhood.at n=32A270632
- Number of nX4 0..1 arrays with every element unequal to 2, 3, 4, 6 or 7 king-move adjacent elements, with upper left element zero.at n=5A305171
- Number of nX6 0..1 arrays with every element unequal to 2, 3, 4, 6 or 7 king-move adjacent elements, with upper left element zero.at n=3A305173
- T(n,k)=Number of nXk 0..1 arrays with every element unequal to 2, 3, 4, 6 or 7 king-move adjacent elements, with upper left element zero.at n=39A305175
- T(n,k)=Number of nXk 0..1 arrays with every element unequal to 2, 3, 4, 6 or 7 king-move adjacent elements, with upper left element zero.at n=41A305175
- Number of n X 6 0..1 arrays with every element unequal to 2, 3, 4, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=3A316761
- T(n,k)=Number of nXk 0..1 arrays with every element unequal to 2, 3, 4, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=39A316763
- T(n,k)=Number of nXk 0..1 arrays with every element unequal to 2, 3, 4, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=41A316763
- Number of new terms added at n-th generation of A306211.at n=22A323475
- Expansion of Product_{k>=1} (1 + x^k) * (1 + x^(2*k)) * (1 + x^(3*k)) * (1 + x^(4*k)).at n=31A327046
- a(n) is the largest number that can be expressed as the sum of three triangular numbers in exactly n ways.at n=12A330810
- a(n) is the largest number that can be expressed as the sum of three positive triangular numbers in exactly n ways.at n=13A330811