259
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 304
- Proper Divisor Sum (Aliquot Sum)
- 45
- 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
- 216
- Möbius Function
- 1
- Radical
- 259
- Omega Function (Ω)
- 2
- 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
- 122
- Smith Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- no
- Odd
- yes
Names
- German
- zweihundertneunundfünfzig· ordinal: zweihundertneunundfünfzigste
- English
- two hundred fifty-nine· ordinal: two hundred fifty-ninth
- Spanish
- doscientos cincuenta y nueve· ordinal: 259º
- French
- deux cent cinquante-neuf· ordinal: deux cent cinquante-neufième
- Italian
- duecentocinquantanove· ordinal: 259º
- Latin
- ducenti quinquaginta novem· ordinal: 259.
- Portuguese
- duzentos e cinquenta e nove· ordinal: 259º
Appears in sequences
- Shifts 2 places left under boustrophedon transform.at n=8A000661
- Number of permutations of [1,2,...,n] with n-1 inversions.at n=6A000707
- Expansion of Product_{n>=1} (1 - x^n)^7.at n=20A000730
- Deceptive nonprimes: composite numbers k that divide the repunit R_{k-1}.at n=1A000864
- Lucky numbers.at n=48A000959
- a(n) = solution to the postage stamp problem with 3 denominations and n stamps.at n=12A001208
- Numbers that are the sum of 4 cubes in more than 1 way.at n=10A001245
- Number of permutations of length n by rises.at n=1A001282
- Number of inequivalent Costas arrays of order n under dihedral group.at n=21A001441
- Central factorial numbers: column 2 in triangle A008956.at n=2A001823
- Central factorial numbers: 1st subdiagonal of A008956.at n=2A001824
- v-pile counts for the 4-Wythoff game with i=2.at n=49A001966
- Wilson remainders: a(n) = ((p-1)!+1)/p mod p, where p = prime(n).at n=63A002068
- Number of partitions of n with exactly two part sizes.at n=42A002133
- Numbers x such that x^2 + y^2 = p^2 = A002144(n)^2, x < y.at n=60A002366
- Numerators of coefficients for numerical differentiation.at n=2A002554
- Numbers k such that (k^2 + k + 1)/3 is prime.at n=36A002640
- a(n) = n + Sum_{k=1..n} pi(k), where pi() = A000720.at n=34A002815
- Problimes (third definition).at n=46A003068
- Sorting numbers: maximal number of comparisons for sorting n elements by list merging.at n=52A003071