13937
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 17472
- Proper Divisor Sum (Aliquot Sum)
- 3535
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10800
- Möbius Function
- -1
- Radical
- 13937
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 3
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
- 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
- a(n) = number of Egyptian fractions 1 = 1/x_1 + ... + 1/x_k (for any k), 0<x_1<...<x_k=n.at n=53A092669
- Nonzero elements of A092669.at n=17A092672
- Greater of a,b where n^2 = a^3 + b^3; a,b>0 and gcd(a,b)=1. The lesser of a,b is the corresponding term in A099532 and n, which is used to order this sequence, is the corresponding term in A099426.at n=33A099533
- Number of finite languages over a binary alphabet (set of nonempty binary words of total length n).at n=10A102866
- Number of partitions of n such that if k is the largest part, then k-2 occurs as a part.at n=43A119907
- Partial sums of A160120.at n=38A162778
- (A178476(n)-3)/9.at n=14A178486
- Number of (n+2) X (n+2) binary arrays avoiding patterns 000 and 011 in rows, columns and nw-to-se diagonals.at n=3A202769
- Number of (n+2)X6 binary arrays avoiding patterns 000 and 011 in rows, columns and nw-to-se diagonals.at n=3A202773
- T(n,k) = Number of (n+2) X (k+2) binary arrays avoiding patterns 000 and 011 in rows, columns and nw-to-se diagonals.at n=24A202777
- Number of distinct values of the sum of 4 products of three 0..n integers.at n=15A225261
- Number of nX3 0..2 arrays avoiding 11 horizontally, 22 vertically and 00 antidiagonally.at n=3A229367
- Number of nX4 0..2 arrays avoiding 11 horizontally, 22 vertically and 00 antidiagonally.at n=2A229368
- T(n,k)=Number of nXk 0..2 arrays avoiding 11 horizontally, 22 vertically and 00 antidiagonally.at n=17A229372
- T(n,k)=Number of nXk 0..2 arrays avoiding 11 horizontally, 22 vertically and 00 antidiagonally.at n=18A229372
- Partial sums of A169707.at n=32A253098
- Expansion of (1+x+x^2) / (1-4*x-4*x^2-x^3).at n=6A275906
- Greater value of a coprime pair (x,y) satisfying x^3+y^3=z^2.at n=32A282639
- a(n) = 2*a(n-1) + a(n-3) with initial terms 1,3,5.at n=12A285184
- Number of nX6 0..1 arrays with every 1 horizontally or antidiagonally adjacent to 1 or 2 neighboring 1s.at n=2A297312