13371
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 17832
- Proper Divisor Sum (Aliquot Sum)
- 4461
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8912
- Möbius Function
- 1
- Radical
- 13371
- 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
- 50
- 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
- Trajectory of 1 under map n->17n+1 if n odd, n->n/2 if n even.at n=22A033965
- Number of partitions of n with equal number of parts congruent to each of 1 and 3 (mod 4).at n=44A035544
- Number of partitions of 2n with equal number of parts congruent to each of 1 and 3 (mod 4).at n=22A035594
- Numbers whose base-5 representation contains exactly three 1's and three 4's.at n=12A045262
- Lucky numbers for which both the sum of the digits and the product of the digits is also a lucky number.at n=28A118559
- Numbers k such that Sum_{i=1..k} i^6 divides Product_{i=1..k} i^6.at n=11A166606
- Joint-rank array of numbers j*r^(i-1), where r=1+sqrt(3), read by antidiagonals.at n=54A182832
- Wiener index of a benzenoid consisting of a double-step zig-zag chain of n hexagons (n >= 2, s = 2123; see the Gutman et al. reference).at n=11A193395
- a(n) = A066048(a(n-1) + a(n-2)) with a(0) = 0 and a(1) = 1.at n=37A277110
- Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n) - 1, where a(0) = 2, a(1) = 3, b(0) = 1, b(1) = 4, b(2) = 5, and (a(n)) and (b(n)) are increasing complementary sequences.at n=16A295965
- a(n) is the least number k for which A330437(k) = n.at n=19A330704
- Matula-Goebel numbers of semi-lone-child-avoiding rooted identity trees.at n=37A331963
- a(n) = Sum_{k=1..n} mu(k) * 2^(n - k).at n=17A344432
- Indices of records in A307730.at n=33A348449
- Numbers k such that A361338(k) = 9.at n=16A361348