485
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 588
- Proper Divisor Sum (Aliquot Sum)
- 103
- 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
- 384
- Möbius Function
- 1
- Radical
- 485
- 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
- 97
- 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
- vierhundertfünfundachtzig· ordinal: vierhundertfünfundachtzigste
- English
- four hundred eighty-five· ordinal: four hundred eighty-fifth
- Spanish
- cuatrocientos ochenta y cinco· ordinal: 485º
- French
- quatre cent quatre-vingt-cinq· ordinal: quatre cent quatre-vingt-cinqième
- Italian
- quattrocentoottantacinque· ordinal: 485º
- Latin
- quadringenti octoginta quinque· ordinal: 485.
- Portuguese
- quatrocentos e oitenta e cinco· ordinal: 485º
Appears in sequences
- Numbers m such that Fibonacci(m) ends with m.at n=19A000350
- a(n) = least m such that if a/b < c/d where a,b,c,d are integers in [0,n], then a/b < k/m < c/d for some integer k.at n=26A001000
- a(n) = 10*a(n-1) - a(n-2); a(0) = 1, a(1) = 5.at n=3A001079
- Number of graphs with n nodes and n-4 edges.at n=11A001432
- A generalized Fibonacci sequence.at n=36A001584
- A Fielder sequence: a(n) = a(n-1) + a(n-2) + a(n-4).at n=10A001641
- Generalized Stirling numbers, [n+8,8]_5.at n=2A001723
- Primes multiplied by 5.at n=24A001750
- Numbers k for which the rank of the elliptic curve y^2 = x^3 + k is 2.at n=72A002155
- Take solution to Pellian equation x^2 - n*y^2 = 1 with smallest positive y and x >= 0; sequence gives a(n) = x, or 1 if n is a square. A002349 gives values of y.at n=53A002350
- a(n) = n^2 + 1.at n=22A002522
- Divisors of 2^48 - 1.at n=32A003553
- a(n) = floor(100*log_2(n)).at n=28A004262
- a(n) = ceiling(n*phi^6), where phi is the golden ratio.at n=27A004961
- Numerators of convergents to log_2(3) = log(3)/log(2).at n=7A005663
- Sums of prime divisors of Ruth-Aaron numbers (A006145).at n=33A006146
- Solution to a Pellian equation: least x such that x^2 - n*y^2 = +- 1.at n=53A006702
- Solution to Pellian: x such that x^2 - n y^2 = +- 1, +- 4.at n=53A006704
- 7th-order maximal independent sets in cycle graph.at n=41A007389
- Largest number not a sum of distinct primes >= prime(n).at n=35A007414