77
domain: N
Properties
Digital Properties
- Digit Count
- 2
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- yes
- Repdigit
- yes
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 96
- Proper Divisor Sum (Aliquot Sum)
- 19
- 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
- 60
- Möbius Function
- 1
- Radical
- 77
- 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
- 22
- Smith Number
- no
Classification
- Natural
- yes
- Even
- no
- Odd
- yes
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
Names
- German
- siebenundsiebzig· ordinal: siebenundsiebzigste
- English
- seventy-seven· ordinal: seventy-seventh
- Spanish
- setenta y siete· ordinal: 77º
- French
- soixante-dix-sept· ordinal: soixante-dix-septième
- Italian
- settantasette· ordinal: 77º
- Latin
- septuaginta septem· ordinal: 77.
- Portuguese
- setenta e sete· ordinal: 77º
Appears in sequences
- The positive integers. Also called the natural numbers, the whole numbers or the counting numbers, but these terms are ambiguous.at n=76A000027
- Numbers that are not squares (or, the nonsquares).at n=68A000037
- a(n) is the number of partitions of n (the partition numbers).at n=12A000041
- 1-digit numbers arranged in alphabetical order, then the 2-digit numbers arranged in alphabetical order, then the 3-digit numbers, etc.at n=62A000052
- Numbers k such that (2k)^4 + 1 is prime.at n=22A000059
- A Beatty sequence: a(n) = floor(n/(e-2)).at n=55A000062
- Partial sums of (unordered) ways of making change for n cents using coins of 1, 2, 5, 10 cents.at n=12A000064
- a(n) = n*(n+3)/2.at n=11A000096
- Lower Wythoff sequence (a Beatty sequence): a(n) = floor(n*phi), where phi = (1+sqrt(5))/2 = A001622.at n=47A000201
- a(8i+j) = 13i + a(j), where 1<=j<=8.at n=47A000202
- A Beatty sequence: floor(n*(e-1)).at n=44A000210
- Remove all factors of 2 from n; or largest odd divisor of n; or odd part of n.at n=76A000265
- Number of bipartite partitions of n white objects and 2 black ones.at n=6A000291
- Sums of three squares: numbers of the form x^2 + y^2 + z^2.at n=66A000378
- Numbers where total number of 1-bits in the exponents of their prime factorization is even; a 2-way classification of integers: complement of A000028.at n=40A000379
- Numbers that are the sum of three nonzero squares.at n=49A000408
- Numbers that are the sum of 4 nonzero squares.at n=61A000414
- Numbers that are the sum of 3 but no fewer nonzero squares.at n=31A000419
- Latest possible occurrence of the first consecutive pair of n-th power residues, modulo any prime.at n=1A000445
- The greedy sequence of integers which avoids 3-term geometric progressions.at n=55A000452