3737
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 3876
- Proper Divisor Sum (Aliquot Sum)
- 139
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3600
- Möbius Function
- 1
- Radical
- 3737
- 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
- 100
- 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
- Number of partitions of 2n with all subsums different from n.at n=19A006827
- Coordination sequence T4 for Zeolite Code HEU.at n=40A008119
- Coordination sequence T7 for Zeolite Code MFI.at n=39A008170
- Coordination sequence T4 for Zeolite Code iRON.at n=43A009884
- a(n) = floor(binomial(n,4)/4).at n=26A011850
- Cycle class sequence c(n) (the number of true cycles of length n in which a certain node is included) for zeolite EUO = EU-1 Nan[AlnSi112-nO224] starting with a T2 atom.at n=11A019121
- Doublets: base-10 representation is the juxtaposition of two identical strings.at n=36A020338
- T(2n,n+2), T given by A026747.at n=5A026862
- Product of n with 666 is palindromic.at n=27A030094
- Quotient of 'base-3' division described in A032537.at n=23A032538
- Numbers whose base-3 representation Sum_{i=0..m} d(i)*3^i has d(m) < d(m-1) > d(m-2) < ...at n=35A032841
- Number of partitions in parts not of the form 13k, 13k+1 or 13k-1. Also number of partitions with no part of size 1 and differences between parts at distance 5 are greater than 1.at n=38A035949
- a(n)=(s(n)+4)/9, where s(n)=n-th base 9 palindrome that starts with 5.at n=30A043076
- Numbers whose consecutive digits differ by 4.at n=38A048406
- Nonprime numbers n such that n and n-reversed (<>n and no leading zeros) have the same number of prime factors and these prime factors (palindromes allowed here) are also reversals of each other.at n=46A050702
- Numbers k such that k^12 == 1 (mod 13^3).at n=20A056086
- Numbers n such that n | 10^n + 9^n + 8^n + 7^n + 6^n.at n=30A057252
- Triangle T(n,k) of numbers of minimal 4-covers of an unlabeled n+4-set that cover k points of that set uniquely (k=4,..,n+4).at n=37A057967
- a(n) is the least odd number of the form p + k^2 with p prime and k > 0 which can be represented in exactly n different ways.at n=25A059400
- a(n) = Sum_{d|n} phi(d^3).at n=19A068963