13702
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 24192
- Proper Divisor Sum (Aliquot Sum)
- 10490
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5760
- Möbius Function
- 1
- Radical
- 13702
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 58
- 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
- G.f.: 1/((1-x)*(1-x^2)*(1-x^3)^2*(1-x^4)*(1-x^5)).at n=48A003402
- a(n) = (d(n)-r(n))/2, where d = A026054 and r is the periodic sequence with fundamental period (1,0,0,0).at n=49A026055
- Numbers k such that the least term in the periodic part of the continued fraction for sqrt(k) is 18.at n=12A031696
- Number of partitions of n with nonnegative rank.at n=37A064174
- Numbers n such that A001414(n) = sum of squared digits of n.at n=26A094908
- Triangle read by rows: T(n,k) is the number of binary sequences of length n containing k subsequences 001 (n,k>=0).at n=47A118424
- a(n) = 169*n^2 + 13.at n=9A158548
- a(n) = Sum_{k=0..n} A109613(k)*A005843(n-k).at n=34A171218
- Partial sums of A001168.at n=8A176673
- Number of ordered triples (w,x,y) with all terms in {1,...,n} and 2w^2>=x^2+y^2.at n=30A211803
- Numbers n such that sum of squares of digits of n equals the sum of prime divisors of n.at n=30A217390
- The number of binary pattern classes in the (2,n)-rectangular grid with 3 '1's and (2n-3) '0's: two patterns are in same class if one of them can be obtained by a reflection or 180-degree rotation of the other.at n=35A225972
- Composite squarefree numbers n such that the ratio (n + 1/2)/(p(i) + 1/2) is an integer, where p(i) are the prime factors of n.at n=0A226020
- Number of gap-free but not complete compositions of n.at n=24A251729
- Number of ordered ways of writing n^2 as a sum of n squares > 1.at n=10A294071
- a(n) is the number of subsets of {1, 2, ..., n} with product of all entries <= n^2 + n.at n=53A298880
- Even numbers k such that A103230(k) is a perfect square.at n=34A332531
- Partial sums of A071619.at n=39A358042