1759
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 1760
- Proper Divisor Sum (Aliquot Sum)
- 1
- 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
- 1758
- Möbius Function
- -1
- Radical
- 1759
- 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
- 148
- 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
- 274
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Number of acyclic quaternary ammonium ions with n carbon atoms.at n=9A000633
- Primes with 6 as smallest primitive root.at n=16A001125
- a(n) = least value of m for which Liouville's function A002819(m) = -n.at n=47A002053
- Primes p such that 2p-1 is also prime.at n=48A005382
- Odd numbers not of form p + 2^k (de Polignac numbers).at n=36A006285
- Primes of form 2n^2 - 2n + 19.at n=24A007639
- Coordination sequence T1 for Zeolite Code MAZ.at n=29A008144
- Coordination sequence T3 for Zeolite Code MEL.at n=27A008152
- Primes p==1 (mod 6) such that 3 and -3 are both cubes (one implies other) modulo p.at n=41A014753
- Initial pile sizes which guarantee a win for player 2 in a certain variant of Nim.at n=31A016741
- Numbers k such that the continued fraction for sqrt(k) has period 80.at n=0A020419
- Primes that remain prime through 2 iterations of function f(x) = 8x + 9.at n=16A023264
- Convolution of natural numbers with Beatty sequence for the golden mean A000201.at n=17A023541
- Numbers with exactly 9 ones in binary expansion.at n=21A023691
- a(n) = Sum_{k=2..n} k*floor(n/k).at n=45A024917
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (1, p(1), p(2), ...), t = (composite numbers).at n=17A025100
- a(n) = n^2 - 5.at n=42A028875
- Primes of form k^2 - 5.at n=12A028877
- a(n) = prime(6*n - 2).at n=45A031380
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 41.at n=7A031539