1601
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 8
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 1602
- 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
- 1600
- Möbius Function
- -1
- Radical
- 1601
- 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
- 60
- 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
- yes
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 252
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Primes p such that the multiplicative order of 2 modulo p is (p-1)/4.at n=13A001134
- Artiads: the primes p == 1 (mod 5) for which Fibonacci((p-1)/5) is divisible by p.at n=11A001583
- a(n) = a(n-2) + a(n-5).at n=41A001687
- Primes of the form 2^q*3^r*5^s + 1.at n=38A002200
- Primes of the form k^2 + 1.at n=11A002496
- a(n) = n^2 + 1.at n=40A002522
- Number of partitions of at most n into at most 5 parts.at n=22A002622
- Number of forests with n unlabeled nodes.at n=12A005195
- Number of binary words of length n in which the ones occur only in blocks of length at least 4.at n=19A005253
- Primitive prime factors of the sequence k^2 + 1 (A002522) in the order that they are found.at n=28A005529
- Primes of the form k^2 + k + 41.at n=39A005846
- A subclass of 2n-node trivalent planar graphs without triangles.at n=10A006797
- Sum of next n primes.at n=8A007468
- Smallest prime > n^2.at n=39A007491
- Primes p == 1 (mod 8), p = a^2 + 64*b^2 such that y^2 = x^3 + p*x has rank 2.at n=20A007766
- Coordination sequence T1 for Zeolite Code AFY.at n=33A008029
- Coordination sequence T1 for Zeolite Code MTN.at n=24A008186
- Dates of birth of Kings Louis I, II, ... of France.at n=12A008746
- Least m such that if a/b < c/d are Farey fractions of order n then there exists k such that a/b < k/m < c/d, k/m reduced.at n=45A009571
- a(n) = floor(n*(n-1)*(n-2)*(n-3)/15).at n=14A011925