497
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 576
- Proper Divisor Sum (Aliquot Sum)
- 79
- 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
- 420
- Möbius Function
- 1
- Radical
- 497
- 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
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
Names
- German
- vierhundertsiebenundneunzig· ordinal: vierhundertsiebenundneunzigste
- English
- four hundred ninety-seven· ordinal: four hundred ninety-seventh
- Spanish
- cuatrocientos noventa y siete· ordinal: 497º
- French
- quatre cent quatre-vingt-dix-sept· ordinal: quatre cent quatre-vingt-dix-septième
- Italian
- quattrocentonovantasette· ordinal: 497º
- Latin
- quadringenti nonaginta septem· ordinal: 497.
- Portuguese
- quatrocentos e noventa e sete· ordinal: 497º
Appears in sequences
- Number of ways of making change for n cents using coins of 1, 2, 5, 10 cents.at n=58A000008
- Central polygonal numbers (the Lazy Caterer's sequence): n(n+1)/2 + 1; or, maximal number of pieces formed when slicing a pancake with n cuts.at n=31A000124
- Pentanacci numbers: a(n) = a(n-1) + a(n-2) + a(n-3) + a(n-4) + a(n-5) with a(0) = a(1) = a(2) = a(3) = a(4) = 1.at n=12A000322
- Number of graphs with n edges.at n=8A000664
- One half of number of non-self-conjugate partitions; also half of number of asymmetric Ferrers graphs with n nodes.at n=22A000701
- Number of bipartite partitions.at n=7A002768
- a(n) = Sum_{d|n, d <= 4} d^2 + 4*Sum_{d|n, d>4} d.at n=67A002791
- The square sieve.at n=38A002960
- Inconsummate numbers in base 10: no number is this multiple of the sum of its digits (in base 10).at n=44A003635
- Number of partitions of 1/n into 3 reciprocals of positive integers.at n=29A004194
- a(0) = 1, a(n) = sum of digits of all previous terms.at n=50A004207
- Divisible only by primes congruent to 7 mod 8.at n=31A004628
- a(n) = n*(5*n+1)/2.at n=14A005475
- Number of factorization patterns of polynomials of degree n over F_2.at n=14A006167
- a(n+1) = a(n) + sum of digits of a(n), with a(1)=7.at n=45A006507
- Numbers whose sum of divisors is a square.at n=25A006532
- Number of alternating 4-signed permutations.at n=4A006873
- Apocalyptic powers: 2^a(n) contains 666.at n=27A007356
- Inverse Moebius transform of triangular numbers.at n=30A007437
- Generated by a sieve: keep first number, drop every 2nd, keep first, drop every 3rd, keep first, drop every 4th, etc.at n=38A007952