5381
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 5382
- 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
- 5380
- Möbius Function
- -1
- Radical
- 5381
- 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
- 116
- 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
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 709
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Smallest nonnegative number that is the sum of 3 squares in exactly n ways.at n=31A000437
- Smallest number that is the sum of 3 squares in at least n ways.at n=31A000451
- Primes p such that the multiplicative order of 2 modulo p is (p-1)/5.at n=16A001135
- Artiads: the primes p == 1 (mod 5) for which Fibonacci((p-1)/5) is divisible by p.at n=31A001583
- Diagonals of Pascal's triangle mod 2 interpreted as binary numbers.at n=25A006921
- Primeth recurrence: a(n+1) = a(n)-th prime.at n=8A007097
- For any circular arrangement of 0..n-1, let S = sum of squares of every sum of two contiguous numbers; then a(n) = # of distinct values of S.at n=31A007773
- Expansion of log(1+log(1+x)*cos(x)).at n=7A009319
- Coordination sequence for FeS2-Marcasite, S position.at n=36A009954
- Expansion of e.g.f. log(sec(x) + log(x+1)).at n=7A013193
- Numbers k such that the continued fraction for sqrt(k) has period 63.at n=8A020402
- Primes p such that p, p+6, p+12, p+18 are all primes.at n=18A023271
- a(n) is the smallest number that is the sum of 3 nonzero squares in exactly n ways.at n=30A025414
- Least sum of 3 distinct nonzero squares in exactly n ways.at n=30A025415
- Lists of 4 primes in arithmetic progression; common difference 6.at n=16A033449
- Initial prime in set of 4 consecutive primes with common difference 6.at n=4A033451
- Sums of 5 distinct powers of 4.at n=15A038473
- Primes with indices that are primes with prime indices.at n=30A038580
- Denominators of continued fraction convergents to sqrt(894).at n=6A042729
- Smallest of three consecutive primes with a difference of 6: primes p such that p+6 and p+12 are the next two primes.at n=38A047948