2067
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 3024
- Proper Divisor Sum (Aliquot Sum)
- 957
- 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
- 1248
- Möbius Function
- -1
- Radical
- 2067
- Omega Function (Ω)
- 3
- 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
- 156
- Smith Number
- yes
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- Coordination sequence T5 for Zeolite Code EUO.at n=28A008100
- Coordination sequence T3 for Zeolite Code MTW.at n=30A008198
- Coordination sequence T7 for Zeolite Code CON.at n=32A009874
- Integers that are squarefree and also the sum of first k squarefrees for some k.at n=30A013932
- a(n) = n^2 + 3*n - 1.at n=44A014209
- Numbers k that divide s(k), where s(1)=1, s(j)=13*s(j-1)+j.at n=16A014861
- a(n) = 1*t(n) + 2*t(n-1) + ... + k*t(n+1-k), where k=floor((n+1)/2) and t is A000201 (lower Wythoff sequence).at n=23A023866
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (natural numbers), t = A000201 (lower Wythoff sequence).at n=22A024863
- Coordination sequence T3 for Zeolite Code MWW.at n=31A024988
- a(n) = a(1)*a(n-1) + a(2)*a(n-2) + ...+ a(n-1)*a(1) for n >= 4, starting 2,1,1.at n=7A025264
- Numbers k such that k*(k+5) is a palindrome.at n=8A028558
- Positions of records in A030707.at n=41A030712
- Lucky numbers with size of gaps equal to 12 (lower terms).at n=24A031894
- Expansion of (1+x*C^4)*C^2, where C = (1-(1-4*x)^(1/2))/(2*x) is g.f. for Catalan numbers, A000108.at n=6A032952
- Coordination sequence T3 for Zeolite Code CFI.at n=30A033601
- Number of linearly ordered Girard monoids of size n; number of t-norms on an n-chain inducing an involutive residual negator.at n=12A034786
- Numbers n such that digit sum of n equals digit sum of 'juxtaposition' and 'sum' of its prime factors (counted with multiplicity).at n=37A036921
- Odd composite numbers n such that the digit sum of n equals digit sum of sum of its prime factors (counted with multiplicity).at n=23A036923
- Digit sum of composite odd number equals digit sum of juxtaposition of its prime factors (counted with multiplicity).at n=34A036925
- Digit sum of 'odd' number equals digit sum of 'sum' and 'juxtaposition' of its prime factors (counted with multiplicity).at n=14A036927