6169
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 6400
- Proper Divisor Sum (Aliquot Sum)
- 231
- 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
- 5940
- Möbius Function
- 1
- Radical
- 6169
- 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
- 111
- 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
- a(n) = floor(n*phi^11), where phi is the golden ratio, A001622.at n=31A004926
- a(n) = round(n*phi^11), where phi is the golden ratio, A001622.at n=31A004946
- Binomial transform of primes.at n=9A007443
- Pseudoprimes to base 92.at n=43A020220
- 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=24A024686
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 62 ones.at n=1A031830
- Composite numbers not divisible by 2 or 3 which in base 3 contain their largest proper factor as a substring.at n=12A063132
- Duplicate of A063132.at n=12A063874
- Least nontrivial multiple of the n-th prime beginning with 6.at n=45A078290
- Composite numbers such that all divisors >1 have the same number of 1's in binary representation.at n=21A089042
- Values of k such that floor(k*tanh(Pi)) = floor((k+1) tanh(Pi)).at n=22A096613
- Numbers n such that sum of n-th and (n+1)-st semiprimes is a square=q^2.at n=38A109311
- Odd numbers n for which 13 is the smallest i (>= 1) with Jacobi symbol J(i,n) getting either a value 0 or -1.at n=18A112076
- Smaller of two consecutive semiprimes with the same digital root.at n=39A118699
- Sum of the squares of the quadratic nonresidues of prime(n).at n=10A125617
- A106486-encodings of combinatorial games equivalent to game {0|1}.at n=25A125997
- Number of fixed points in range [A014137(n-1)..A014138(n-1)] of permutations A130919/A130920.at n=12A130968
- Number of odd squarefree semiprimes (A046388) < 2^n.at n=14A146168
- The 3-D toothpick sequence A160160, but using toothpicks of length 4; a(n) is the number of nodes occupied after n steps.at n=31A160430
- Integers n that divide f(n), where f is the change-of-base function defined at A214969, using b = (golden ratio) and c=b^2.at n=42A214970