494
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- yes
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 840
- Proper Divisor Sum (Aliquot Sum)
- 346
- 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
- 216
- Möbius Function
- -1
- Radical
- 494
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 3
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
- 48
- Smith Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- yes
- Odd
- no
Names
- German
- vierhundertvierundneunzig· ordinal: vierhundertvierundneunzigste
- English
- four hundred ninety-four· ordinal: four hundred ninety-fourth
- Spanish
- cuatrocientos noventa y cuatro· ordinal: 494º
- French
- quatre cent quatre-vingt-quatorze· ordinal: quatre cent quatre-vingt-quatorzième
- Italian
- quattrocentonovantaquattro· ordinal: 494º
- Latin
- quadringenti nonaginta quattuor· ordinal: 494.
- Portuguese
- quatrocentos e noventa e quatro· ordinal: 494º
Appears in sequences
- Partial sums of (unordered) ways of making change for n cents using coins of 1, 2, 5, 10 cents.at n=24A000064
- 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); sequence gives values of n where |P(n)| sets a new record.at n=20A000092
- a(n) = (9*n+1)*(9*n+8).at n=2A001534
- a(n) = 4*a(n-1) - a(n-2) + 1, with a(0) = 0, a(1) = 2.at n=5A001571
- Numbers n such that every digit contains a loop (version 2).at n=46A001744
- Triangular numbers plus quarter-squares: n*(n+1)/2 + floor((n+1)^2/4) (i.e., A000217(n) + A002620(n+1)).at n=25A001859
- Numbers dividing A002037(i) and larger than A002037(i-1), for some i>0.at n=44A002038
- Palindromes in base 10.at n=58A002113
- a(0) = 1; for n > 0, a(n) = a(n-1) + floor(sqrt(a(n-1))).at n=47A002984
- Number of 2-line arrays; or number of P-graphs with 2n edges.at n=4A003169
- Cluster series for bond percolation problem on honeycomb.at n=9A003199
- Numbers that are the sum of 10 positive 5th powers.at n=19A003355
- Inconsummate numbers in base 10: no number is this multiple of the sum of its digits (in base 10).at n=43A003635
- a(n) = round(n*phi^7), where phi is the golden ratio, A001622.at n=17A004942
- a(n) = ceiling(n*phi^7), where phi is the golden ratio, A001622.at n=17A004962
- a(n) = (2^n + C(2*n,n))/2.at n=6A005317
- Least k such that binomial(k,n) has n or more distinct prime factors.at n=22A005733
- Least k such that binomial(k,n) has n or more distinct prime factors.at n=23A005733
- Second-order Eulerian numbers: a(n) = 2^n - 2*n.at n=9A005803
- Numbers whose ternary expansion contains no 1's.at n=35A005823