5773
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
- 6048
- Proper Divisor Sum (Aliquot Sum)
- 275
- 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
- 5500
- Möbius Function
- 1
- Radical
- 5773
- 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
- 49
- 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
- Coordination sequence T4 for Zeolite Code EUO.at n=47A008099
- Coordination sequence T2 for Zeolite Code MEP.at n=45A008158
- a(n) = smallest k >= n such that k | (2^k + n).at n=62A015948
- Numbers k such that the continued fraction for sqrt(k) has period 88.at n=7A020427
- Prefix primes in base 8 (written in base 8).at n=40A024768
- Self-convolution of array T given by A026703.at n=6A026996
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 36 ones.at n=21A031804
- a(n) = floor(10000/sqrt(n)).at n=2A033433
- a(n) is the smallest value of m such that A002378(m), the m-th oblong number, contains exactly n 3's.at n=5A048535
- Counterbalanced numbers: Composite numbers k such that phi(k)/(sigma(k)-k) is an integer.at n=11A055940
- Prefixing, suffixing or inserting a 7 in the number anywhere gives a prime.at n=35A069832
- Duplicate of A055940.at n=11A070158
- Numbers k such that k! - k# + 1 is prime, where k# is the primorial function.at n=19A081712
- Third row of number array A082105.at n=37A082109
- a(n) = (n+1)*prime(n) + n*prime(n+1).at n=26A097240
- Number of partitions of n in which every part occurs 1, 4, or 5 times. Also number of partitions of n in which every part is congruent to {1, 3, 4, 5, 7} mod 8.at n=44A100853
- Numbers k such that the k-th triangular number contains only digits {1,5,6}.at n=22A119133
- Let f(k) = exp(Pi*sqrt(k)); sequence gives numbers k such that ceiling(f(k)) - f(k) < 1/10^3.at n=18A127022
- Let f(n) = exp(Pi*sqrt(n)); sequence gives numbers n such that ceiling(f(n)) - f(n) < 1/10^4.at n=9A127023
- Numbers k such that k and k^2 use only the digits 2, 3, 5, 7 and 9.at n=14A137084