17729
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 26
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 17730
- Proper Divisor Sum (Aliquot Sum)
- 1
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 17728
- Möbius Function
- -1
- Radical
- 17729
- 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
- 141
- 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
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 2035
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Numbers k such that the continued fraction for sqrt(k) has period 91.at n=9A020430
- Sums of 5 distinct powers of 4.at n=33A038473
- One half of the number of non-self-conjugate balanced partitions.at n=58A067772
- Primes which can be expressed as sum of distinct powers of 4.at n=25A077718
- Primes p of the form 2*prime(k) + 3 such that 2*prime(k+1) + 3 is the next prime after p.at n=35A089528
- Primes of the form 128n+65.at n=34A105129
- Primes of the form 12k+5 generated recursively. Initial prime is 5. General term is a(n) = Min {p is prime; p divides 4+Q^2; p == 5 (mod 12)}, where Q is the product of previous terms in the sequence.at n=13A124987
- Engel expansion of L(3, chi3), where L(s, chi3) is the Dirichlet L-function for the non-principal character modulo 3.at n=8A129409
- Primes of the form 2*3*5*7*k+89, k >= 0.at n=37A141866
- Primes congruent to 27 mod 53.at n=37A142557
- Primes congruent to 29 mod 59.at n=39A142756
- Primes congruent to 39 mod 61.at n=28A142837
- First differences of A000219.at n=18A191659
- Consider two consecutive primes {p,q} such that P=2p+q and Q=2q+p are both prime. The sequence gives primes P.at n=38A248482
- Number of length 3+3 0..n arrays with every four consecutive terms having the sum of some three elements equal to three times the fourth.at n=15A248540
- Primes p such that p^k is zeroless for k=0,...,5.at n=21A253645
- a(n) = Fibonacci(n+2) + n - 2.at n=19A255875
- a(n) = 2*n^4 - floor(2^(1/4)*n)^4.at n=15A257854
- Smallest beastly prime in base n: smallest prime p with a base-n expansion containing the substring 666.at n=7A286342
- Primes congruent to 65 (mod 192).at n=33A301619