5743
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 5744
- Proper Divisor Sum (Aliquot Sum)
- 1
- 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
- 5742
- Möbius Function
- -1
- Radical
- 5743
- Omega Function (Ω)
- 1
- Little Omega Function (ω)
- 1
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
- 80
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- yes
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 756
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Number of signed trees with n nodes.at n=8A000060
- Number of oriented trees with n nodes.at n=8A000238
- Primes of form 2n^2 - 2n + 19.at n=41A007639
- a(n) = M(n) + m(n) for n >= 2, where M(n) = max{ a(i) + a(n-i): i = 1..n-1 }, m(n) = min{ a(i) + a(n-i): i = 1..n-1 }.at n=23A022905
- Primes that remain prime through 2 iterations of the function f(x) = 8*x + 5.at n=41A023262
- Primes that remain prime through 3 iterations of function f(x) = 8x + 5.at n=10A023293
- Convolution of natural numbers >= 2 and (F(2), F(3), F(4), ...).at n=13A023550
- 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=12A031573
- a(n) = a(n-1) + n^2 if n prime else a(n-1) - n, starting with a(0) = 0.at n=42A051353
- Primes p from A031924 such that A052180(primepi(p)) = 7.at n=31A052231
- Primes p such that x^29 = 2 has no solution mod p.at n=23A059256
- Primes p such that p^6 reversed is also prime.at n=26A059699
- Primes with 10 as smallest positive primitive root.at n=14A061323
- a(n) = (9*n^2 + 13*n + 6)/2.at n=35A064226
- Define the composite field of a prime q to be f(q) = (t,s) if p, q, r are three consecutive primes and q-p = t and r-q = s. This is a sequence of primes q with field (2,6).at n=32A073650
- a(0) = 1, a(n+1) = a(n) + next prime larger than a(n).at n=11A074839
- Expansion of (1-x)/(1+2*x^2-x^3).at n=22A078035
- Final terms of rows of A078448.at n=46A078447
- a(n) = A063416(n)/7.at n=44A088409
- Indices of primes of the form k^2 - 11.at n=30A091273