3064
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 5760
- Proper Divisor Sum (Aliquot Sum)
- 2696
- 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
- 1528
- Möbius Function
- 0
- Radical
- 766
- Omega Function (Ω)
- 4
- 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
- 48
- 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
- Class numbers of quadratic fields.at n=20A002141
- Number of unsensed planar maps with n edges and without faces of degree 1 or 2.at n=8A006393
- Coordination sequence for diamond.at n=35A008253
- Coordination sequence T2 for Zeolite Code -PAR.at n=39A009856
- Coordination sequence for CaF2(2), F position.at n=35A009925
- Expansion of e.g.f.: log(sech(x)+arcsinh(x))=x-2/2!*x^2+4/3!*x^3-12/4!*x^4+68/5!*x^5...at n=7A013207
- Numbers k such that the continued fraction for sqrt(k) has period 40.at n=19A020379
- Numbers k such that Fib(k) == -21 (mod k).at n=30A023168
- Numbers with exactly 6 1's in their ternary expansion.at n=34A023697
- a(n) = [ Sum{(sqrt(j+1)-sqrt(i+1))^2} ], 1 <= i < j <= n.at n=38A025222
- a(n) = sum of the numbers between the two n's in A026358.at n=28A026361
- Expansion of Product (1+q^(2k-1))^(-8)*(1+q^(4k))^(-8), k=1..inf.at n=6A034998
- Numbers k such that the string 7,4 occurs in the base 9 representation of k but not of k-1.at n=41A044318
- Numbers n such that string 6,4 occurs in the base 10 representation of n but not of n-1.at n=33A044396
- Numbers n such that string 6,4 occurs in the base 10 representation of n but not of n+1.at n=33A044777
- Numbers whose base-5 representation contains exactly two 2's and three 4's.at n=7A045288
- a(n) = Sum_{h=0..n, k=0..n} T(h,k), array T counting knights' moves as in A049604.at n=19A047881
- Discriminants of imaginary quadratic fields with class number 24 (negated).at n=26A048925
- a(n)=T(n,n+2), array T as in A049723.at n=30A049730
- a(n) = a(1) + a(2) + ... + a(n-1) + a(m) for n >= 4, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 2, and a(3) = 1.at n=12A049948