12801
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 18144
- Proper Divisor Sum (Aliquot Sum)
- 5343
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8000
- Möbius Function
- -1
- Radical
- 12801
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 3
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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 169
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- Fermat pseudoprimes to base 2, also called Sarrus numbers or Poulet numbers.at n=25A001567
- Pseudoprimes to base 5.at n=22A005936
- Pseudoprimes to base 10.at n=36A005939
- Euler pseudoprimes: composite numbers n such that 2^((n-1)/2) == +-1 (mod n).at n=16A006970
- Composite numbers k such that k == +-1 (mod 8) and 2^((k-1)/2) == 1 (mod k).at n=12A006971
- Pseudoprimes to base 20.at n=35A020148
- Pseudoprimes to base 40.at n=38A020168
- Strong pseudoprimes to base 50.at n=11A020276
- a(n) = (2*n+1)*(10*n+1).at n=25A033574
- Euler-Jacobi pseudoprimes: 2^((n-1)/2) == (2 / n) mod n, where (2 / n) is a Jacobi symbol.at n=13A047713
- Composite numbers m such that phi(m)*sigma(m) is divisible by m-1.at n=26A065149
- a(n) is the first of a triple of consecutive integers, each of which is the product of three distinct primes.at n=26A066509
- Sarrus numbers n (A001567) which satisfy mu(n) = -1 and which are not Super-Poulet numbers (A050217).at n=12A074380
- a(n) = 512*n + 1.at n=25A076338
- Sarrus numbers with more than 2 distinct prime factors.at n=13A080747
- Third row of Pascal-(1,3,1) array A081578.at n=40A081585
- Pseudoprimes to bases 2 and 5.at n=6A083732
- Number of partitions of n with even number (or 0) 2's.at n=37A092295
- Pseudotwinprimes p+2 for primes p such that p+2 divides p^(p+2)+2 and p+2 is composite.at n=7A100873
- Rows of A114000 expressed as decimals (a sequence related to the number of divisors of 2n-1).at n=13A114001