486
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 1092
- Proper Divisor Sum (Aliquot Sum)
- 606
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 162
- Möbius Function
- 0
- Radical
- 6
- Omega Function (Ω)
- 6
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 97
- Smith Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- yes
- Carmichael Number
- no
Classification
- Even
- yes
- Odd
- no
Names
- German
- vierhundertsechsundachtzig· ordinal: vierhundertsechsundachtzigste
- English
- four hundred eighty-six· ordinal: four hundred eighty-sixth
- Spanish
- cuatrocientos ochenta y seis· ordinal: 486º
- French
- quatre cent quatre-vingt-six· ordinal: quatre cent quatre-vingt-sixième
- Italian
- quattrocentoottantasei· ordinal: 486º
- Latin
- quadringenti octoginta sex· ordinal: 486.
- Portuguese
- quatrocentos e oitenta e seis· ordinal: 486º
Appears in sequences
- Coefficients of the 3rd-order mock theta function f(q).at n=47A000025
- Coefficient of q^(2n-1) in the series expansion of Ramanujan's mock theta function f(q).at n=23A000199
- a(n) is smallest number > a(n-1) of form a(i)*a(j), i < j < n.at n=20A000423
- Number of nonnegative solutions to x^2 + y^2 + z^2 <= n^2.at n=9A000604
- a(n) = max{(n - i)*a(i) : i < n}; a(0) = 1.at n=17A000792
- Number of connected graphs with n nodes, n+2 edges.at n=7A001436
- Perrin sequence (or Perrin numbers, or Ondrej Such sequence): a(n) = a(n-2) + a(n-3) with a(0) = 3, a(1) = 0, a(2) = 2.at n=22A001608
- Numbers n such that every digit contains a loop (version 2).at n=42A001744
- A self-generating sequence: every positive integer occurs as a(i)-a(j) for a unique pair i,j.at n=13A001856
- a(n) = n*phi(n).at n=26A002618
- Numbers k such that (k^2 + k + 1)/19 is prime.at n=19A002643
- a(n) = Sum_{d|n, d <= 4} d^2 + 4*Sum_{d|n, d>4} d.at n=47A002791
- E.g.f. 1 + x*exp(x) + x^2*exp(2*x).at n=6A003013
- Numbers that are the sum of 6 positive 4th powers.at n=36A003340
- Numbers that are the sum of 2 positive 5th powers.at n=5A003347
- 3-smooth numbers: numbers of the form 2^i*3^j with i, j >= 0.at n=32A003586
- Inconsummate numbers in base 10: no number is this multiple of the sum of its digits (in base 10).at n=38A003635
- Möbius transform of A003959.at n=63A003968
- Moebius transform of A003961; a(n) = phi(A003961(n)), where A003961 shifts the prime factorization of n one step towards the larger primes.at n=63A003972
- a(n) = round(100*log_2(n)).at n=28A004263