490
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 1026
- Proper Divisor Sum (Aliquot Sum)
- 536
- 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
- 168
- Möbius Function
- 0
- Radical
- 70
- Omega Function (Ω)
- 4
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 22
- 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
- no
- Carmichael Number
- no
Classification
- Even
- yes
- Odd
- no
Names
- German
- vierhundertneunzig· ordinal: vierhundertneunzigste
- English
- four hundred ninety· ordinal: four hundred ninetieth
- Spanish
- cuatrocientos noventa· ordinal: 490º
- French
- quatre cent quatre-vingt-dix· ordinal: quatre cent quatre-vingt-dixième
- Italian
- quattrocentonovanta· ordinal: 490º
- Latin
- quadringenti nonaginta· ordinal: 490.
- Portuguese
- quatrocentos e noventa· ordinal: 490º
Appears in sequences
- a(n) is the number of partitions of n (the partition numbers).at n=19A000041
- Convolution of A000203 with itself.at n=9A000385
- Number of ways of placing n labeled balls into 3 indistinguishable boxes with at least 2 balls in each box.at n=2A000478
- S2(j,2j+2) where S2(n,k) is a 2-associated Stirling number of the second kind.at n=2A000497
- Number of different score sequences that are possible in an n-team round-robin tournament.at n=9A000571
- Number of bond-rooted polyenoids with n edges.at n=6A000913
- Triangle of Narayana numbers T(n,k) = C(n-1,k-1)*C(n,k-1)/k with 1 <= k <= n, read by rows. Also called the Catalan triangle.at n=31A001263
- Triangle of Narayana numbers T(n,k) = C(n-1,k-1)*C(n,k-1)/k with 1 <= k <= n, read by rows. Also called the Catalan triangle.at n=32A001263
- Numbers n such that every digit contains a loop (version 2).at n=45A001744
- Related to Zarankiewicz's problem.at n=29A001841
- Convolved Fibonacci numbers.at n=4A001875
- Sum of totient function: a(n) = Sum_{k=1..n} phi(k), cf. A000010.at n=40A002088
- A generalized partition function.at n=9A002603
- Number of threshold functions of n variables.at n=5A002833
- Self numbers or Colombian numbers (numbers that are not of the form m + sum of digits of m for any m).at n=51A003052
- Numbers that are the sum of 6 positive 5th powers.at n=13A003351
- Fully multiplicative with a(prime(k)) = partition(k+1).at n=60A003964
- a(n) = floor(100*log_2(n)).at n=29A004262
- Record gaps between primes.at n=43A005250
- Noncototients: numbers k such that x - phi(x) = k has no solution.at n=47A005278