5667
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 7560
- Proper Divisor Sum (Aliquot Sum)
- 1893
- 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
- 3776
- Möbius Function
- 1
- Radical
- 5667
- 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
- 129
- 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
- Positions of remoteness 6 in Beans-Don't-Talk.at n=46A005694
- a(n) = s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n+1-k), where k = [ (n+1)/2 ], s = (Lucas numbers).at n=12A024469
- Number of partitions of n that do not contain 2 as a part.at n=36A027336
- a(n) = Sum_{k=0..n-1} T(n,k)*T(n,2n-k), T given by A027960.at n=6A027980
- 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 75.at n=6A031573
- Numbers whose set of base-12 digits is {3,4}.at n=16A032836
- Convolution of L(n+1) := A000204(n+1) (Lucas), n>=0, with L(n+7), n>=0.at n=6A067985
- Numbers n such that phi(n + phi(n)) = sigma(n).at n=14A074874
- Duplicate of A074874.at n=14A074892
- Expansion of (1-x)/(1-x+2*x^2+x^3).at n=21A078021
- Number of partitions of n-th composite number not containing the smallest prime factor.at n=23A091094
- Smallest number not occurring earlier fitting the repeating pattern "11223344556677889900".at n=39A098781
- A bisection of A000960.at n=42A099061
- Generalized Mancala solitaire (A002491); to get n-th term, start with n and successively round up to next 10 multiples of n-1, n-2, ..., 1, for n>=1.at n=34A113747
- Number of permutations of length n which avoid the patterns 1324, 2314, 4312.at n=8A116757
- Expansion of x*(1 + x^2 + x^4)/(1 - x - x^3 - x^5 - x^7).at n=20A117761
- Numbers k for which 8*k+1, 8*k+5 and 8*k+7 are primes.at n=36A123980
- Beastly fax numbers: numbers containing the fax number of the Beast (667, one more than its regular number) in their decimal expansion.at n=5A138563
- List of different composite numbers in Pascal-like triangles with index of asymmetry y = 1 and index of obliqueness z = 0 or z = 1.at n=50A141065
- a(n) is the number of numbers removed in each step of Eratosthenes's sieve for 10!.at n=21A145537