290
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 540
- Proper Divisor Sum (Aliquot Sum)
- 250
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- yes
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 112
- Möbius Function
- -1
- Radical
- 290
- 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
- 117
- 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
- zweihundertneunzig· ordinal: zweihundertneunzigste
- English
- two hundred ninety· ordinal: two hundred ninetieth
- Spanish
- doscientos noventa· ordinal: 290º
- French
- deux cent quatre-vingt-dix· ordinal: deux cent quatre-vingt-dixième
- Italian
- duecentonovanta· ordinal: 290º
- Latin
- ducenti nonaginta· ordinal: 290.
- Portuguese
- duzentos e noventa· ordinal: 290º
Appears in sequences
- Number of ways of making change for n cents using coins of 1, 2, 5, 10 cents.at n=47A000008
- Construct a triangle as in A036262. Sequence is one less than the position of the first number larger than 2 in the n-th row (n-th difference).at n=20A000232
- Number of nonnegative solutions to x^2 + y^2 + z^2 <= n.at n=54A000606
- Number of nonnegative solutions to x^2 + y^2 + z^2 <= n.at n=55A000606
- Number of stereoisomeric paraffins with n carbon atoms.at n=10A000626
- 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=20A001000
- a(n) = sigma_2(n): sum of squares of divisors of n.at n=16A001157
- Number of ways of making change for n cents using coins of 1, 2, 5, 10, 50, 100 cents.at n=47A001312
- Maximal number of unattacked squares with n queens on n X n board (answers for n >= 17 only probable).at n=25A001366
- a(n) is the number of partitions of n into at most 3 parts; also partitions of n+3 in which the greatest part is 3; also number of unlabeled multigraphs with 3 nodes and n edges.at n=56A001399
- Winning moves in Fibonacci nim.at n=51A001581
- Triangular numbers plus quarter-squares: n*(n+1)/2 + floor((n+1)^2/4) (i.e., A000217(n) + A002620(n+1)).at n=19A001859
- v-pile counts for the 4-Wythoff game with i=2.at n=55A001966
- a(n) = Sum_{d|n, d == 1 mod 4} d^2 - Sum_{d|n, d == 3 mod 4} d^2.at n=33A002173
- a(n) = Sum_{d|n, d == 1 mod 4} d^2 - Sum_{d|n, d == 3 mod 4} d^2.at n=16A002173
- Earliest sequence with a(a(n))=5n.at n=59A002518
- a(n) = n^2 + 1.at n=17A002522
- a(n) = Sum_{d|n, d <= 3} d^2 + 3*Sum_{d|n, d>3} d.at n=51A002660
- Erroneous version of A001157.at n=16A002800
- Problimes (first definition).at n=52A003066