3016
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 6300
- Proper Divisor Sum (Aliquot Sum)
- 3284
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 1344
- Möbius Function
- 0
- Radical
- 754
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 3
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
- 66
- 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 words of length n in a certain language.at n=29A005819
- Low temperature antiferromagnetic susceptibility for square lattice.at n=7A007215
- Coordination sequence T1 for Zeolite Code BIK.at n=34A008047
- Coordination sequence T3 for Zeolite Code -PAR.at n=39A009857
- Coordination sequence T1 for Zeolite Code RTH.at n=38A009893
- Pisot sequence E(4,21), a(n) = floor(a(n-1)^2/a(n-2) + 1/2).at n=4A010908
- Fibonacci sequence beginning 0, 8.at n=14A022091
- Numbers k such that Fib(k) == -21 (mod k).at n=29A023168
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (1, p(1), p(2), ...), t = (composite numbers).at n=20A024480
- s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = A000201 (lower Wythoff sequence), t = A001950 (upper Wythoff sequence).at n=19A024686
- s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = A000201 (lower Wythoff sequence), t = A001950 (upper Wythoff sequence).at n=18A025119
- Number of partitions of n into distinct parts >= 2.at n=54A025147
- Numbers k that divide the (right) concatenation of all numbers <= k written in base 11 (most significant digit on left).at n=24A029456
- 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 27.at n=16A031525
- Composite binary rooted trees with external nodes.at n=16A035102
- Coordination sequence T2 for Zeolite Code AFN.at n=39A038402
- Numbers n such that string 1,0 occurs in the base 8 representation of n but not of n-1.at n=46A044195
- Numbers k such that the string 1,6 occurs in the base 10 representation of k but not of k-1.at n=33A044348
- Numbers n such that string 1,6 occurs in the base 10 representation of n but not of n+1.at n=33A044729
- a(n) = Sum_{k=1..floor(n/2)} T(n, 2k), array T as in A049777.at n=24A049779