739
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 740
- 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
- 738
- Möbius Function
- -1
- Radical
- 739
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 20
- Smith 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
- 131
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Names
- German
- siebenhundertneununddreißig· ordinal: siebenhundertneununddreißigste
- English
- seven hundred thirty-nine· ordinal: seven hundred thirty-ninth
- Spanish
- setecientos treinta y nueve· ordinal: 739º
- French
- sept cent trente-neuf· ordinal: sept cent trente-neufième
- Italian
- settecentotrentanove· ordinal: 739º
- Latin
- septingenti triginta novem· ordinal: 739.
- Portuguese
- setecentos e trinta e nove· ordinal: 739º
Appears in sequences
- Let A(n) = #{(i,j,k): i^2 + j^2 + k^2 <= n}, V(n) = (4/3)*Pi*n^(3/2), P(n) = A(n) - V(n); A000092 gives values of n where |P(n)| sets a new record; sequence gives A(A000092(n)).at n=8A000413
- Primes p of the form 3k+1 such that -sqrt(p) < sum_{x=1..p} cos(2*Pi*x^3/p) < sqrt(p).at n=18A000922
- Primes with 3 as smallest primitive root.at n=30A001123
- Primes p such that the multiplicative order of 2 modulo p is (p-1)/3.at n=11A001133
- Numbers k such that (k^2 + k + 1)/21 is prime.at n=36A002644
- Schur's 1926 partition theorem: number of partitions of n into parts 6n+1 or 6n-1.at n=56A003105
- Number of partitions of n into parts 5k+2 or 5k+3.at n=51A003106
- Primes p with a Fibonacci primitive root g, i.e., such that g^2 = g + 1 (mod p).at n=40A003147
- Numbers that are the sum of 5 positive 4th powers.at n=48A003339
- Numbers that are the sum of 11 positive 6th powers.at n=12A003367
- Divisible only by primes congruent to 4 mod 5.at n=33A004618
- Divisible only by primes congruent to 4 mod 7.at n=24A004622
- Class 4+ primes (for definition see A005105).at n=8A005108
- Class 3- primes (for definition see A005109).at n=37A005111
- Positions of remoteness 6 in Beans-Don't-Talk.at n=25A005694
- Prime-indexed primes: primes with prime subscripts.at n=31A006450
- Emirps (primes whose reversal is a different prime).at n=23A006567
- Primes whose reversal in base 10 is also prime (called "palindromic primes" by David Wells, although that name usually refers to A002385). Also called reversible primes.at n=38A007500
- Primes == 3 (mod 8).at n=35A007520
- Handsome numbers: sum of positive powers of its digits; a(n) = Sum_{i=1..k} d[i]^e[i] where d[1..k] are the decimal digits of a(n), e[i] > 0.at n=44A007532