3764
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
- 2
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 6594
- Proper Divisor Sum (Aliquot Sum)
- 2830
- 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
- 1880
- Möbius Function
- 0
- Radical
- 1882
- Omega Function (Ω)
- 3
- 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
- 131
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- Coordination sequence T2 for Zeolite Code ATT.at n=44A008042
- Coordination sequence T5 for Zeolite Code EUO.at n=38A008100
- Coordination sequence T7 for Zeolite Code NES.at n=39A008211
- Phi(n) + 5 | sigma(n + 5).at n=40A015784
- Cycle class sequence c(n) (the number of true cycles of length n in which a certain node is included) for zeolite MTW = ZSM-12 Nan[AlnSi28-nO56] starting with a T3 atom.at n=11A019197
- a(n) = T(2n-1,n-1), T given by A026648.at n=6A026652
- a(n) = T(n,[ n/2 ]), T given by A026648.at n=13A026654
- Even numbers k such that in k^2 the parity of digits alternates.at n=38A030157
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 30.at n=39A031528
- a(n)=(s(n)+4)/9, where s(n)=n-th base 9 palindrome that starts with 5.at n=33A043076
- a(n) = T(2n-1,n), array T given by A048225.at n=32A048234
- Consider a room of size r X s where rs = 2n and 1 <= r, 1 <= s; count ways to arrange n Tatami mats in room; a(n) = total number of ways for all choices of r and s. Two arrangements are distinguished if one is a rotation or reflection of the other.at n=19A067925
- Interprimes which are of the form s*prime, s=4.at n=16A075279
- Sum of terms in periodic part of continued fraction expansion of square root of -1 + 3^n.at n=12A077631
- a(n) = A077696(n+1)/A077696(n).at n=13A077697
- Slowest increasing sequence where the first pair of digits sums to 10, the next pair also does and so on.at n=36A098791
- Least positive integer that can be represented as the sum of a prime and a triangular number in exactly n ways.at n=34A101182
- a(n) = number of distinct values of Product_{i=1..r} x_i!*i!^x_i, where (x_1, ..., x_r) is an r-tuple of nonnegative integers with Sum_{i=1..r} i*x_i = n.at n=36A102465
- a(n) = 5*a(n-1) + 4*a(n-2), with a(0) = 4, a(1) = 4.at n=5A106567
- Number of labeled mobiles (cycle rooted trees) with n generators.at n=4A108527