487
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 488
- 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
- 486
- Möbius Function
- -1
- Radical
- 487
- 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
- 141
- Smith Number
- no
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
- 93
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Names
- German
- vierhundertsiebenundachtzig· ordinal: vierhundertsiebenundachtzigste
- English
- four hundred eighty-seven· ordinal: four hundred eighty-seventh
- Spanish
- cuatrocientos ochenta y siete· ordinal: 487º
- French
- quatre cent quatre-vingt-sept· ordinal: quatre cent quatre-vingt-septième
- Italian
- quattrocentoottantasette· ordinal: 487º
- Latin
- quadringenti octoginta septem· ordinal: 487.
- Portuguese
- quatrocentos e oitenta e sete· ordinal: 487º
Appears in sequences
- Primes that divide at least one term in every Fibonacci sequence.at n=19A000057
- Number of n-node rooted trees of height 7.at n=11A000418
- Number of primes < prime(n)^2.at n=16A000879
- Primes p of the form 3k+1 such that -sqrt(p) < sum_{x=1..p} cos(2*Pi*x^3/p) < sqrt(p).at n=13A000922
- Primes with 3 as smallest primitive root.at n=20A001123
- Primes == +-1 (mod 8).at n=44A001132
- A sequence of sorted odd primes 3 = p_1 < p_2 < ... < p_m such that p_i-2 divides the product p_1*p_2*...*p_(i-1) of the earlier primes and each prime factor of p_i-1 is a prime factor of twice the product.at n=10A001259
- Numbers k such that phi(2k+1) < phi(2k).at n=5A001837
- Full reptend primes: primes with primitive root 10.at n=32A001913
- Class numbers associated with terms of A001986.at n=17A001987
- Class numbers associated with terms of A001986.at n=18A001987
- Let p be the n-th odd prime. a(n) is the least prime congruent to 7 modulo 8 such that Legendre(-a(n), q) = -Legendre(-1, q) for all odd primes q <= p.at n=5A001988
- Prime determinants of forms with class number 2.at n=42A002052
- Primes of the form 4*k + 3.at n=47A002145
- Largest prime == 7 (mod 8) with class number 2n+1.at n=3A002147
- Primes of the form 2^q*3^r*5^s + 1.at n=26A002200
- Primes of the form 6m + 1.at n=43A002476
- Numbers k such that (k^2 + k + 1)/21 is prime.at n=27A002644
- Number of integer points in a certain quadrilateral scaled by a factor of n.at n=32A002789
- a(n) = n^2 written backwards.at n=27A002942