13942
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 20916
- Proper Divisor Sum (Aliquot Sum)
- 6974
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6970
- Möbius Function
- 1
- Radical
- 13942
- Omega Function (Ω)
- 2
- 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
- 58
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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 maximal base-9 run length is 4.at n=25A037999
- Growth function of an infinite cubic graph (number of nodes at distance <=n from fixed node).at n=31A038621
- Numbers having four 1's in base 9.at n=33A043460
- Numbers n such that x^n + x^5 + x^4 + x^3 + x^2 + x + 1 is irreducible over GF(2).at n=48A057484
- Total length of longest increasing runs in all permutations of n elements.at n=6A064314
- Number of monomial terms in expansion of n-th coefficient of replicable function as a polynomial in [c1, c2, c3, c4, c5, c7, c8, c9, c11, c17, c19, c23].at n=46A112331
- a(2)=2; thereafter a(n) = smallest number m such that a(n-1)+m = (a(n-1) followed by the leading digit of m).at n=4A224753
- Partial sums of A255743.at n=23A255764
- Expansion of Product_{k>=0} (1-x^(3*k+1))^(3*k+1).at n=34A285050
- Solution of the complementary equation a(n) = 2*a(n-2) - b(n-1) + n, where a(0) = 4, a(1) = 5, b(0) = 1, and (a(n)) and (b(n)) are increasing complementary sequences.at n=25A295068
- Number of ordered ways of writing n^3 as a sum of n squares of nonnegative integers.at n=6A298938
- Numbers m > 3 such that m-1, m, m+1 belong to A307002.at n=42A340748
- Sum of the prime numbers in, but not on the border of, an n X n square array whose elements are the numbers from 1..n^2, listed in increasing order by rows.at n=20A344847
- Numbers k such that k and 4k, taken together, contain all digits 1 though 9 at least once.at n=11A346135
- G.f. A(x) satisfies: A(x) = 1 + x + x^2 * A(x/(1 - x)) / (1 - x)^5.at n=9A351648
- Even numbers in A090252 in order of appearance.at n=19A354255
- Rectangular array, read by antidiagonals: row n consists of the numbers m whose ternary representation starts with 2 and has exactly n runs.at n=44A370925