13771
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
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 14112
- Proper Divisor Sum (Aliquot Sum)
- 341
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 13432
- Möbius Function
- 1
- Radical
- 13771
- 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
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 39 ones.at n=0A031807
- Number of score sequences in tournament with n players, when 10 points are awarded in each game.at n=4A047737
- Numbers k > 1 such that, in base 8, k and k^2 contain the same digits in the same proportion.at n=8A061662
- Define a(1)=1. Thereafter a(n) is the smallest positive integer with the property that a(n)^2 cannot be created by summing the squares of at most n values chosen among the previous terms (with repeats allowed).at n=18A111302
- a(n) = 15*n^2 + 9*n + 1.at n=30A134153
- A "Morgan Voyce" transform of A103210.at n=5A166697
- Numbers n such that 3 and 5 do not divide swing(n) = A056040(n).at n=40A196748
- The least number with exactly n ones in the continued fraction of its square root.at n=39A206578
- Odd integers k such that for every m >= 1 the numbers k*4^m - 1 have at least three prime factors, not necessarily distinct, and k*4^m - 1 has at least two-element covering set.at n=21A233552
- The 60-degree spoke (or ray) of a hexagonal spiral of Ulam.at n=34A244802
- Decimal representation of the x-axis, from the origin to the right edge, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 286", based on the 5-celled von Neumann neighborhood.at n=15A280564
- Numbers k such that (13*10^k - 43)/3 is prime.at n=18A290962
- Partial sums of A299274.at n=27A299275
- Numbers k such that 419*2^k+1 is prime.at n=17A323109
- Table read by rows. T(n, k) = (-1)^(n - k) * Sum_{j=k..n} binomial(n, j) * A354794(j, k) * j^(n - j).at n=23A359759
- Number of integer partitions of n whose nonzero first differences are a submultiset of the parts.at n=46A364675
- Triangular array read by rows: T(m,n) = number of Yamanouchi words over the alphabet {1, 2, ..., n} of length m that start with n, m >= 1, n = 1..m.at n=70A369589
- a(n) = (21*n^2 + 9*n + 2)/2.at n=36A381109