2669
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 2844
- Proper Divisor Sum (Aliquot Sum)
- 175
- 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
- 2496
- Möbius Function
- 1
- Radical
- 2669
- Omega Function (Ω)
- 2
- 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
- 146
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- Odd numbers not of form p + 2^k (de Polignac numbers).at n=59A006285
- Coordination sequence T1 for Zeolite Code ATV.at n=33A008043
- Coordination sequence T4 for Zeolite Code EUO.at n=32A008099
- Coordination sequence T6 for Zeolite Code MTW.at n=34A008201
- a(n) = floor(n*(n-1)*(n-2)*(n-3)/9).at n=14A011919
- Expansion of 1/((1-6*x)*(1-11*x)).at n=3A016174
- Expansion of Product_{m>=1} (1+q^m)^(-17).at n=4A022612
- Number of distinct products ijk with 0 <= i,j,k <= n.at n=34A027426
- Golc sequence in base 2. Left to right concatenation of n,int(log_2(n)),int(log_2(int(log_2(n)))),... in base 2.at n=40A028432
- "EFK" (unordered, size, unlabeled) transform of 2,1,1,1,...at n=44A032303
- Denominators of continued fraction convergents to sqrt(543).at n=7A042039
- Numbers having three 5's in base 8.at n=6A043443
- Numbers k such that the string 8,5 occurs in the base 9 representation of k but not of k-1.at n=35A044328
- Numbers n such that string 6,9 occurs in the base 10 representation of n but not of n-1.at n=28A044401
- Numbers n such that string 8,5 occurs in the base 9 representation of n but not of n+1.at n=35A044709
- Numbers n such that string 6,6 occurs in the base 10 representation of n but not of n+1.at n=26A044779
- Numbers n such that string 6,9 occurs in the base 10 representation of n but not of n+1.at n=28A044782
- a(n) = a(1) + a(2) + ... + a(n-1) - a(m) for n >= 4, where m = n - 1 - 2^p and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1 and a(2) = a(3) = 3.at n=12A049926
- Let Py(n)=A000330(n)=n-th square pyramidal number. Consider all integer triples (i,j,k), j >= k>0, with Py(i)=Py(j)+Py(k), ordered by increasing i; sequence gives k values.at n=25A053721
- a(n) = (2*n-1)*(13*n^2-13*n+6)/6.at n=8A063493