5801
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 5802
- 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
- 5800
- Möbius Function
- -1
- Radical
- 5801
- 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
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 761
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Artiads: the primes p == 1 (mod 5) for which Fibonacci((p-1)/5) is divisible by p.at n=35A001583
- Expansion of 1/(1-x^2-x^3-x^4-x^5-x^6-x^7-x^8).at n=21A013985
- Powers of fifth root of 15 rounded to nearest integer.at n=16A018157
- Powers of fifth root of 15 rounded up.at n=16A018158
- Numbers k such that the continued fraction for sqrt(k) has period 63.at n=10A020402
- Primes that remain prime through 2 iterations of function f(x) = 8x + 3.at n=45A023261
- Primes that remain prime through 3 iterations of function f(x) = 6x + 1.at n=6A023287
- a(n) = b(n) + d(n), where b(n) = (n-th Lucas number > 3) and d(n) = (n-th non-Fibonacci number).at n=15A023487
- a(n) = b(n) + d(n), where b(n) = (n-th Lucas number > 1) and d(n) = (n-th non-Lucas number).at n=16A023493
- Numbers k such that the continued fraction for sqrt(k) has odd period and if the last term of the periodic part is deleted the two central terms are both 30.at n=0A031618
- Primes of form x^2+59*y^2.at n=33A033238
- Honaker primes: primes P(k) such that sum of digits of P(k) equals sum of digits of k.at n=40A033548
- Numbers whose base-4 representation contains exactly three 1's and four 2's.at n=4A045104
- 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=41A047948
- Automorphic primes: p such that p^p ends with the digits of p.at n=41A052228
- Primes p from A031924 such that A052180(primepi(p)) = 7.at n=32A052231
- Primes p such that x^29 = 2 has no solution mod p.at n=24A059256
- Primes of form 100*k + 1.at n=19A062800
- Primes p such that 3p is equidistant from consecutive prime twin pairs.at n=36A074931
- a(n) = prime(k) where k = n-th prime congruent to 1 mod 10.at n=32A078656