15709
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 16416
- Proper Divisor Sum (Aliquot Sum)
- 707
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 15004
- Möbius Function
- 1
- Radical
- 15709
- 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
- 84
- Smith Number
- yes
- 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
- Fermat pseudoprimes to base 2, also called Sarrus numbers or Poulet numbers.at n=30A001567
- Divisors of 2^22 - 1.at n=10A003531
- Divisors of 2^44 - 1.at n=27A003549
- Euler pseudoprimes: composite numbers n such that 2^((n-1)/2) == +-1 (mod n).at n=17A006970
- Strong pseudoprimes to base 4.at n=13A020230
- Strong pseudoprimes to base 64.at n=38A020290
- Numbers whose base-4 representation contains exactly four 1's and three 3's.at n=31A045132
- Super-Poulet numbers: Poulet numbers whose divisors d all satisfy d|2^d-2.at n=14A050217
- Smith numbers which are also base-2 pseudoprimes.at n=3A063844
- Composite numbers k which divide A001045(k-1).at n=24A066488
- Smallest base-2 Fermat pseudoprime x that has ord(2,x) = n, or 0 if one does not exist.at n=21A086250
- G.f.: (1+x^3+x^4+x^5+x^6+x^9)/((1-x)*(1-x^2)^2*(1-x^3)*(1-x^4)).at n=40A090491
- Triangle read by rows: T(n,m) = number of 3-uniform hypergraphs with m hyperedges on n unlabeled nodes, where 0 <= m <= C(n,3).at n=48A092337
- Lesser of a,b where n^2 = a^3 + b^3; a,b > 0 and gcd(a,b)=1. The greater of a,b is the corresponding term in A099533 and n, which is used to order this sequence, is the corresponding term in A099426.at n=39A099532
- Structured hexagonal diamond numbers (vertex structure 5).at n=22A100178
- Indices of primes in sequence defined by A(0) = 97, A(n) = 10*A(n-1) - 63 for n > 0.at n=20A100998
- Partial sums of ceiling(n^2/2) (A000982).at n=45A131941
- a(1)=1, a(n)=a(n-1)+n if n odd, a(n)=a(n-1)+ n^2 if n is even.at n=44A140113
- Sarrus numbers A001567 that are not Carmichael numbers A002997.at n=22A153508
- Nonprimes k such that 9*k divides 2^(k-1) - 1.at n=22A175521