1739
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 1824
- Proper Divisor Sum (Aliquot Sum)
- 85
- 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
- 1656
- Möbius Function
- 1
- Radical
- 1739
- 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
- 55
- Smith Number
- no
- 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
- a(n) = (12*n+1)*(12*n+11).at n=3A001538
- Number of solutions to a linear inequality.at n=37A002797
- a(n) = ceiling(n*phi^8), where phi is the golden ratio, A001622.at n=37A004963
- Number of paraffins.at n=19A005999
- Coordination sequence T2 for Zeolite Code DDR.at n=26A008072
- Coordination sequence T4 for Zeolite Code VNI.at n=26A009910
- Number of triples of different integers from [ 2,n ] with no common factors between pairs.at n=33A015620
- a(n+1) (n >= 1) is smallest number > a(n) which is the sum of cubes of distinct earlier terms.at n=41A019511
- Fibonacci sequence beginning 1, 31.at n=10A022401
- a(n) = [ a(n-1)/a(1) + a(n-2)/a(2) + ... + a(1)/a(n-1) ], for n >= 3.at n=14A022857
- a(n) = floor( (2nd elementary symmetric function of S(n))/(first elementary symmetric function of S(n)) ), where S(n) = {first n+1 positive integers congruent to 1 mod 3}.at n=47A024219
- Numbers that are the sum of 3 nonzero squares in exactly 10 ways.at n=43A025330
- Numbers that are the sum of 3 distinct nonzero squares in exactly 10 ways.at n=43A025348
- [ exp(15/17)*n! ].at n=5A030885
- Numbers whose set of base-8 digits is {1,3}.at n=27A032915
- a(n) = prime(n) + A033955(n).at n=45A033956
- Fractional part of square root of a(n) starts with 7: first term of runs.at n=39A034113
- Nonprime; becomes prime if any digit is deleted (zeros not allowed in the number).at n=31A034304
- Multiplicity of highest weight (or singular) vectors associated with character chi_6 of Monster module.at n=38A034394
- Partial sums of A000009 (partitions into distinct parts).at n=29A036469