5699
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 29
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 5880
- Proper Divisor Sum (Aliquot Sum)
- 181
- 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
- 5520
- Möbius Function
- 1
- Radical
- 5699
- 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
- 67
- 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
- Cycle class sequence c(2n) (the number of true cycles of length 2n in which a certain node is included) for zeolite DFO = DAF-1 [Mg14Al52P66O264].7R.40H2O starting with a T2 atom.at n=5A019004
- a(n) is the least k > 0 such that k and 3k are anagrams in base n (written in base 10).at n=38A023095
- a(n) is least k such that k and 9k are anagrams in base n (written in base 10).at n=32A023101
- 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=33A023866
- 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=32A024863
- Number of ways to partition n labeled elements into sets of sizes of at least 2 and order the sets.at n=8A032032
- Numbers whose set of base-14 digits is {1,2}.at n=22A032934
- a(n) = floor(47*(n-3/2)^(3/2)).at n=24A050256
- Write fundamental unit for real quadratic field of discriminant n as x + y*omega; sequence gives values of x for n == 1 mod 4.at n=51A053370
- Numbers n such that n^2 contains exactly 8 different digits.at n=27A054036
- Dimension of the space of weight n cuspidal newforms for Gamma_1( 83 ).at n=20A063356
- Positions of non-crossing fixed-point-free involutions encoded by A014486 in A055089. Permutation of A064640.at n=16A064638
- Positions of non-crossing fixed-point-free involutions encoded by A014486 (after reflection) in A055089. Permutation of A064640.at n=12A064639
- Positions of non-crossing fixed-point-free involutions (encoded by A014486) in A055089, sorted to ascending order.at n=12A064640
- (p^2-5)/4 for odd primes p.at n=34A074367
- a(n) = 4*n^2 + 6*n + 1.at n=37A082108
- a(n) = Sum_{i=1..n} ( Sum_{j=1..n} i^j ).at n=4A086787
- Numbers of the form k^2 - k - 1 whose digit sum is also a number of the form k^2 - k - 1.at n=27A117746
- Composite numbers k such that k+d+1 is prime for all divisors d of k greater than 1.at n=39A120776
- Numbers k such that k and k^2 together contain all ten digits.at n=10A122477