97
domain: N
Properties
Digital Properties
- Digit Count
- 2
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 98
- 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
- 96
- Möbius Function
- -1
- Radical
- 97
- 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
- 118
- Smith Number
- no
Classification
- Natural
- yes
- Even
- no
- Odd
- yes
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
- 25
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Names
- German
- siebenundneunzig· ordinal: siebenundneunzigste
- English
- ninety-seven· ordinal: ninety-seventh
- Spanish
- noventa y siete· ordinal: 97º
- French
- quatre-vingt-dix-sept· ordinal: quatre-vingt-dix-septième
- Italian
- novantasette· ordinal: 97º
- Latin
- nonaginta septem· ordinal: 97.
- Portuguese
- noventa e sete· ordinal: 97º
Appears in sequences
- Let k = p_1^e_1 p_2^e_2 p_3^e_3 ... be the prime factorization of n. Sequence gives k such that the sum of the numbers of 1's in the binary expansions of e_1, e_2, e_3, ... is odd.at n=45A000028
- Numbers that are not squares (or, the nonsquares).at n=87A000037
- Number of positive integers <= 2^n of form x^2 + y^2.at n=8A000050
- 1-digit numbers arranged in alphabetical order, then the 2-digit numbers arranged in alphabetical order, then the 3-digit numbers, etc.at n=51A000052
- Numbers k such that (2k)^4 + 1 is prime.at n=27A000059
- A Beatty sequence: a(n) = floor(n/(e-2)).at n=69A000062
- Odious numbers: numbers with an odd number of 1's in their binary expansion.at n=48A000069
- a(n) = Sum_{k=0..n} p(k) where p(k) = number of partitions of k (A000041).at n=9A000070
- Record gaps between primes (upper end) (compare A002386, which gives lower ends of these gaps).at n=4A000101
- Denumerants: Expansion of 1/((1-x)*(1-x^2)*(1-x^5)).at n=40A000115
- Positive zeros of Bessel function of order 0 rounded to nearest integer.at n=30A000134
- Lower Wythoff sequence (a Beatty sequence): a(n) = floor(n*phi), where phi = (1+sqrt(5))/2 = A001622.at n=59A000201
- a(8i+j) = 13i + a(j), where 1<=j<=8.at n=59A000202
- A Beatty sequence: floor(n*(e-1)).at n=56A000210
- Construct a triangle as in A036262. Sequence is one less than the position of the first number larger than 2 in the n-th row (n-th difference).at n=11A000232
- Construct a triangle as in A036262. Sequence is one less than the position of the first number larger than 2 in the n-th row (n-th difference).at n=13A000232
- a(0) = 1, a(1) = 4, and a(n) = a(n-1) + a(n-2) for n >= 2.at n=8A000285
- Numbers that are the sum of 2 nonzero squares.at n=32A000404
- Numbers that are the sum of three nonzero squares.at n=63A000408
- Number of bipartite partitions of n white objects and 3 black ones.at n=5A000412