1967
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
- 5
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 2256
- Proper Divisor Sum (Aliquot Sum)
- 289
- 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
- 1680
- Möbius Function
- 1
- Radical
- 1967
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 99
- 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
- EULER transform of 3, 2, 2, 2, 2, 2, 2, 2, ...at n=11A000713
- a(n) = floor(n*phi^10), where phi is the golden ratio, A001622.at n=16A004925
- The limiting sequence [A259095(r(r+1)/2-s,r), s=0,1,2,...,r-1] for very large r.at n=28A005576
- Number of strict 3rd-order maximal independent sets in path graph.at n=35A007384
- Coordination sequence T2 for Zeolite Code DDR.at n=28A008072
- Index of 3^n within sequence of numbers of form 2^i*3^j (A003586).at n=49A022330
- Numbers with exactly 9 ones in binary expansion.at n=35A023691
- T(n,n-4), where T is the array in A026148.at n=6A026155
- a(n) = T(2n,n+1), where T is the array in A026148.at n=4A026161
- Positions of records in A030717.at n=45A030722
- Numbers k such that the continued fraction for sqrt(k) has even period 2*m and the m-th term of the periodic part is 5.at n=38A031408
- Number of partitions of n with equal nonzero number of parts congruent to each of 2, 3 and 4 (mod 5).at n=44A035591
- a(n) = 2i + 1 where i is the least index such that A039508(i) = n or 0 if there is none.at n=37A039511
- Number of partitions satisfying cn(0,5) < cn(2,5) + cn(3,5).at n=25A039841
- Numbers k such that 6 and 7 occur juxtaposed in the base-10 representation of k but not of k-1.at n=38A043255
- Numbers k such that 6 and 7 occur juxtaposed in the base-10 representation of k but not of k+1.at n=38A044035
- Numbers k such that string 1,0 occurs in the base 7 representation of k but not of k-1.at n=39A044145
- Numbers n such that string 5,7 occurs in the base 8 representation of n but not of n-1.at n=34A044234
- Numbers k such that the string 2,5 occurs in the base 9 representation of k but not of k-1.at n=27A044274
- Numbers n such that string 6,7 occurs in the base 10 representation of n but not of n-1.at n=21A044399