6001
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 7
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 6372
- Proper Divisor Sum (Aliquot Sum)
- 371
- 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
- 5632
- Möbius Function
- 1
- Radical
- 6001
- 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
- Numbers k such that k^2 and k have same last 3 digits.at n=25A008853
- Expansion of e.g.f. sinh(arcsin(x) * exp(x)).at n=7A012321
- Pseudoprimes to base 36.at n=39A020164
- Pseudoprimes to base 42.at n=20A020170
- Pseudoprimes to base 60.at n=17A020188
- Pseudoprimes to base 70.at n=28A020198
- Pseudoprimes to base 100.at n=33A020228
- Strong pseudoprimes to base 70.at n=9A020296
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (odd natural numbers), t = (primes).at n=21A024603
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (odd natural numbers), t = (primes).at n=20A025117
- Take list of squares, move left digit of each term to end of previous term.at n=41A032760
- Number of partitions of n such that cn(1,5) < cn(0,5) = cn(2,5) < cn(3,5) = cn(4,5).at n=79A036861
- Base-7 palindromes that start with 2.at n=40A043016
- a(n)=(s(n)+4)/10, where s(n)=n-th base 10 palindrome that starts with 6.at n=22A043085
- Composite numbers not ending in zero that yield a prime when turned upside down.at n=30A048889
- Numbers k such that 255*2^k-1 is prime.at n=31A050886
- Numbers k such that (k!)^2 + k! + 1 is prime.at n=8A051856
- Numerators in expansion of Euler transform of b(n) = 1/2.at n=7A061159
- Numbers not ending in 0 whose cubes are concatenations of other cubes.at n=5A061341
- Sum of n-th row of triangle of primes: 2; 2 3 2; 2 3 5 3 2; 2 3 5 7 5 3 2; ...; where n-th row contains 2n+1 terms.at n=39A061802