17749
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 28
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 5
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 17750
- 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
- 17748
- Möbius Function
- -1
- Radical
- 17749
- 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
- 22
- 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
- yes
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 2038
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- a(n) = 5*a(n-1) - 2*a(n-2), with a(0)=2, a(1)=9.at n=6A020698
- Numbers whose base-2 representation has exactly 13 runs.at n=14A043580
- Smallest prime having alternating bit sum (A065359) equal to n.at n=7A065084
- Primes which, although they have correct parity, are not in the prime number maze.at n=29A065123
- Primes which can be expressed as sum of distinct powers of 4.at n=26A077718
- a(n) is the least prime p such that exponent of highest power of 2 dividing 3p+1 equals n.at n=11A087964
- An inverse Catalan transform of J(2n).at n=12A100335
- Primes of the form 256 k + 85.at n=16A127593
- Least primes of the form k 4^n + (4^n-1)/3.at n=6A127598
- Smallest prime of the form k*prime(n+1)+prime(n) = j*prime(n+2)+prime(n+1) for free integer multipliers k and j.at n=16A129918
- Numbers such that the digital sum base 2 and the digital sum base 3 and the digital sum base 4 all are equal.at n=5A135122
- a(n) = a(n-1) + 4a(n-2) - 4a(n-3).at n=14A136326
- Primes congruent to 49 mod 59.at n=32A142776
- Primes congruent to 59 mod 61.at n=37A142857
- Positions of zeros in A165597.at n=14A165598
- The Collatz iteration of these primes produces only even numbers, primes and 1.at n=45A177000
- Array T(n,k) of odd Collatz preimages read by antidiagonals.at n=50A178415
- Dispersion of A016813 (4k+1, k>1), by antidiagonals.at n=48A191667
- Odd numbers producing 4 odd numbers in the Collatz iteration.at n=27A198587
- Number of nX7 0..2 arrays with new values 0..2 introduced in row major order and no element equal to any horizontal or vertical neighbor (colorings ignoring permutations of colors).at n=2A207996