1719
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 2496
- Proper Divisor Sum (Aliquot Sum)
- 777
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 1140
- Möbius Function
- 0
- Radical
- 573
- Omega Function (Ω)
- 3
- 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
- 148
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- Number of partitions into non-integral powers.at n=20A000327
- Number of discordant permutations.at n=6A000561
- Flavius Josephus's sieve: Start with the natural numbers; at the k-th sieving step, remove every (k+1)-st term of the sequence remaining after the (k-1)-st sieving step; iterate.at n=46A000960
- Number of achiral rooted trees.at n=17A003241
- Numbers that are the sum of 11 positive 6th powers.at n=27A003367
- Number of Twopins positions.at n=16A005685
- 11*n^2 + 11*n + 3.at n=12A006222
- a(n) = Sum_{k=0..n} binomial(3*k,k)*binomial(3*n-3*k,n-k).at n=4A006256
- Odd numbers not of form p + 2^k (de Polignac numbers).at n=35A006285
- Juxtapose pairs of primes.at n=3A007795
- Coordination sequence T4 for Zeolite Code DDR.at n=26A008074
- a(n) = n^2 + 3*n - 1.at n=40A014209
- Positive integers n such that 2^n (mod n) == 2^9 (mod n).at n=71A015931
- Coordination sequence T5 for Zeolite Code TER.at n=28A016437
- Numbers k such that the continued fraction for sqrt(k) has period 28.at n=29A020367
- Place where n-th 1 occurs in A023125.at n=21A022787
- Numbers k such that Fibonacci(k) == 34 (mod k).at n=18A023180
- Numerator of n*(n-3)*(3*n^2-6*n+2)/(3*(n-1)*(n-2)).at n=6A023417
- a(n) = 12^n-n^2.at n=3A024142
- a(n) = T(2*n, n+3), T given by A027011.at n=3A027014