711
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 9
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 1040
- Proper Divisor Sum (Aliquot Sum)
- 329
- 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
- 468
- Möbius Function
- 0
- Radical
- 237
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 64
- Smith 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
Names
- German
- siebenhundertelf· ordinal: siebenhundertelfste
- English
- seven hundred eleven· ordinal: seven hundred eleventh
- Spanish
- setecientos once· ordinal: 711º
- French
- sept cent onze· ordinal: sept cent onzième
- Italian
- settecentoundici· ordinal: 711º
- Latin
- septingenti undecim· ordinal: 711.
- Portuguese
- setecentos e onze· ordinal: 711º
Appears in sequences
- Numbers that are the sum of 10 positive 5th powers.at n=28A003355
- Odd numbers written backwards.at n=58A004156
- Pentagonal numbers written backwards.at n=9A004163
- a(n) = number of length-n sequences s with s[1]=1, s[2]=1, s[k-1] <=s[k] <= s[k-2]+s[k-1] (s is called a sub-Fibonacci sequence of length n).at n=6A005269
- Leading term of Stirling's approximation to n!, sqrt(2*Pi)*n^(n+(1/2))/e^n, rounded up.at n=6A005395
- Number of 2-diregular digraphs with n nodes.at n=5A005641
- a(n) = 2^(n-1) + 2^[ n/2 ] + 2^[ (n-1)/2 ] - F(n+3).at n=11A005674
- Positions of remoteness 6 in Beans-Don't-Talk.at n=20A005694
- Number of entries in first n rows of Pascal's triangle not divisible by 3.at n=60A006048
- Number of n-element posets which are unions of 2 chains.at n=8A006251
- Primitive modest numbers.at n=29A007627
- Juxtapose pairs of primes (starting at 1).at n=2A007794
- Coordination sequence T1 for Zeolite Code BOG.at n=19A008049
- Coordination sequence T5 for Zeolite Code MFI.at n=17A008168
- Numbers that do not contain the letter 't'.at n=47A008523
- Molien series for A_4.at n=35A008627
- Coordination sequence T1 for Zeolite Code AHT.at n=18A009866
- Numbers k such that all terms in the periodic part of the continued fraction for sqrt(k) except the final term are 1.at n=41A010342
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly three 1's.at n=12A013650
- a(n) = n*(9*n-2).at n=9A013656