250
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 7
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 468
- Proper Divisor Sum (Aliquot Sum)
- 218
- 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
- 100
- Möbius Function
- 0
- Radical
- 10
- Omega Function (Ω)
- 4
- 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
- 109
- 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
- zweihundertfünfzig· ordinal: zweihundertfünfzigste
- English
- two hundred fifty· ordinal: two hundred fiftieth
- Spanish
- doscientos cincuenta· ordinal: 250º
- French
- deux cent cinquante· ordinal: deux cent cinquantième
- Italian
- duecentocinquanta· ordinal: 250º
- Latin
- ducenti quinquaginta· ordinal: 250.
- Portuguese
- duzentos e cinquenta· ordinal: 250º
Appears in sequences
- Number of ways of writing n as a sum of 5 squares.at n=9A000132
- a(n) = sigma_2(n): sum of squares of divisors of n.at n=13A001157
- Number of fixed 2-dimensional triangular-celled animals with n cells (n-iamonds, polyiamonds) in the 2-dimensional hexagonal lattice.at n=6A001420
- Partial sums of A001462; also a(n) is the last occurrence of n in A001462.at n=35A001463
- Fibonacci entry points: a(n) = smallest m > 0 such that the n-th prime divides Fibonacci(m).at n=53A001602
- v-pile positions of the 4-Wythoff game with i=3.at n=47A001968
- Related to a highly composite sequence (A002497).at n=14A002498
- a(n) = Sum_{d|n, d <= 3} d^2 + 3*Sum_{d|n, d>3} d.at n=64A002660
- Coefficients for numerical integration.at n=3A002685
- Erroneous version of A001157.at n=13A002800
- For n > 4, a(n) is the least integer > a(n-1) with precisely two representations a(n) = a(i) + a(j), 1 <= i < j < n; and a(n) = n for n=1..4.at n=50A003044
- Schur's 1926 partition theorem: number of partitions of n into parts 6n+1 or 6n-1.at n=44A003105
- The number m such that A001950(m) = A003231(A003234(n)).at n=49A003250
- a(n) = a(n-1) + a(n-4) with a(0) = 0, a(1) = a(2) = a(3) = 1.at n=20A003269
- a(n) = 2*n^(n-2).at n=4A003308
- Numbers that are the sum of 2 positive cubes.at n=17A003325
- Numbers that are the sum of 10 positive 4th powers.at n=27A003344
- Numbers that are the sum of 8 positive 5th powers.at n=8A003353
- Least number m such that 12^m == +- 1 (mod 12n + 1).at n=51A003568
- Roman numerals with 1 letter, in alphabetical order; then those with 2 letters, etc.at n=40A003588