5383
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
- 4
- Divisor Sum
- 6160
- Proper Divisor Sum (Aliquot Sum)
- 777
- 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
- 4608
- Möbius Function
- 1
- Radical
- 5383
- 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
- 72
- 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(n+2)(2n+1)/8).at n=27A002717
- Numbers k such that Fib(k) == 13 (mod k).at n=30A023178
- a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n+1-k), where k = floor((n+1)/2), s = (natural numbers >= 2), t = (Fibonacci numbers).at n=14A024309
- a(n) = Sum{T(i,j)}, 0<=j<=i, 0<=i<=n, T given by A026907.at n=6A026917
- 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 73.at n=5A031571
- "EFK" (unordered, size, unlabeled) transform of 2,1,1,1,...at n=50A032303
- Expansion of (x^3+2*x+1) / ((x-1)^4*(x^2+x+1)^2).at n=39A038391
- Denominators of continued fraction convergents to sqrt(862).at n=9A042665
- n plus a googol is prime.at n=15A049014
- Expansion of series related to Liouville's Last Theorem: g.f. sum_{t>0} (-1)^(t+1) *x^(t*(t+1)/2) / ( (1-x^t)^4 *product_{i=1..t} (1-x^i) ).at n=18A059821
- a(n) is the smallest positive integer such that no term in S={a(1),...,a(n)}, n>=3, divides the sum of any two other distinct terms of S, after first initializing the sequence with a(1)=3 and a(2)=4.at n=32A068573
- a(0) = 0; a(1)=1; for n>1, a(n) = least positive integer m not among a(1),...,a(n-1) such that |m-a(n-1)| > |a(n-1)-a(n-2)|.at n=33A078783
- Numbers of the form n!+n^3.at n=6A080668
- Resultant of the polynomial x^3-1 and the Chebyshev polynomial of the first kind T_n(x).at n=5A085640
- Number of tilings of a centro-symmetric octagon of integral sides, all of length n, into squares and 45-degree rhombi with unitary side lengths.at n=1A093937
- a(n) is the area of the triangle with sides prime(n), prime(n+2) and prime(n+4), rounded down to the nearest integer.at n=23A096384
- Expansion of (1-x^4-2*x^3)/((x-1)*(x^2+x+1)*(x^2+4*x-1)).at n=6A108929
- A triangular array related to A077028 and distributing the values of A007582.at n=42A110552
- Number at end of segment n of A078783.at n=10A117072
- From the game of Quod: number of "squares" on an n X n array of points with the four corner points deleted.at n=14A124479