15841
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 18944
- Proper Divisor Sum (Aliquot Sum)
- 3103
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 12960
- Möbius Function
- -1
- Radical
- 15841
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 102
- 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
- yes
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Deceptive nonprimes: composite numbers k that divide the repunit R_{k-1}.at n=27A000864
- Strong pseudoprimes to base 2.at n=5A001262
- Fermat pseudoprimes to base 2, also called Sarrus numbers or Poulet numbers.at n=31A001567
- Carmichael numbers: composite numbers k such that a^(k-1) == 1 (mod k) for every a coprime to k.at n=8A002997
- Divisors of 2^45 - 1.at n=13A003550
- Pseudoprimes to base 3.at n=29A005935
- Pseudoprimes to base 5.at n=28A005936
- Pseudoprimes to base 6.at n=34A005937
- Euler pseudoprimes: composite numbers n such that 2^((n-1)/2) == +-1 (mod n).at n=18A006970
- Composite numbers k such that k == +-1 (mod 8) and 2^((k-1)/2) == 1 (mod k).at n=13A006971
- Odd octagonal numbers: (2n+1)*(6n+1).at n=36A014641
- Pseudoprimes to base 11.at n=34A020139
- Pseudoprimes to base 13.at n=41A020141
- Pseudoprimes to base 15.at n=26A020143
- Pseudoprimes to base 17.at n=36A020145
- Pseudoprimes to base 20.at n=41A020148
- Pseudoprimes to base 33.at n=37A020161
- Pseudoprimes to base 39.at n=30A020167
- Pseudoprimes to base 52.at n=41A020180
- Pseudoprimes to base 54.at n=39A020182