3032
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 8
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 5700
- Proper Divisor Sum (Aliquot Sum)
- 2668
- 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
- 1512
- Möbius Function
- 0
- Radical
- 758
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 61
- 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
- Number of trees of diameter 5.at n=18A000147
- Conjecturally largest even integer which is an unordered sum of two primes in exactly n ways.at n=36A000954
- Number of 3-line partitions of n.at n=15A000991
- Associated Mersenne numbers.at n=21A001351
- a(n) = a(n-2) + a(n-5).at n=44A001687
- Denominators of convergents to cube root of 4.at n=11A002355
- Coordination sequence T1 for Zeolite Code LTL.at n=40A008138
- Coordination sequence T2 for Coesite.at n=29A008268
- Coordination sequence T5 for Zeolite Code DFO.at n=42A009879
- Smallest positive number that can be written as sum of distinct Fibonacci numbers in n ways.at n=51A013583
- Numbers k such that phi(k) + 9 | sigma(k + 9).at n=30A015788
- Numbers k such that Fib(k) == 21 (mod k).at n=21A023179
- n written in fractional base 6/3.at n=32A024636
- a(n) = T(n,n), T given by A026519. Also a(n) = number of integer strings s(0), ..., s(n), counted by T, such that s(n) = 0.at n=11A026520
- a(n) = T(n,n), T given by A026552. Also a(n) is the number of integer strings s(0),...,s(n) counted by T, such that s(n)=0.at n=11A026553
- 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 13.at n=26A031511
- Concatenation of n and n + 2 or {n,n+2}.at n=29A032607
- a(n) = floor(T_(n+1)/T_(n)) where T_n is n-th tangential or "Zag" number (see A000182).at n=42A034972
- Number of partitions in parts not of the form 15k, 15k+1 or 15k-1. Also number of partitions with no part of size 1 and differences between parts at distance 6 are greater than 1.at n=36A035955
- G.f. satisfies A(x) = 1 + x*cycle_index(G,A(x)) where G = cyclic group of order 2 generated by (1,2)(3,4).at n=7A036723