59
domain: N
Properties
Digital Properties
- Digit Count
- 2
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 60
- 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
- 58
- Möbius Function
- -1
- Radical
- 59
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 32
- Smith Number
- no
Classification
- Natural
- yes
- Even
- no
- Odd
- yes
Primality
- Prime
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- yes
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- yes
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 17
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Names
- German
- neunundfünfzig· ordinal: neunundfünfzigste
- English
- fifty-nine· ordinal: fifty-ninth
- Spanish
- cincuenta y nueve· ordinal: 59º
- French
- cinquante-neuf· ordinal: cinquante-neufième
- Italian
- cinquantanove· ordinal: 59º
- Latin
- quinquaginta novem· ordinal: 59.
- Portuguese
- cinquenta e nove· ordinal: 59º
Appears in sequences
- Smallest prime power >= n.at n=53A000015
- Smallest prime power >= n.at n=54A000015
- Smallest prime power >= n.at n=55A000015
- Smallest prime power >= n.at n=56A000015
- Smallest prime power >= n.at n=57A000015
- Smallest prime power >= n.at n=58A000015
- Mosaic numbers or multiplicative projection of n: if n = Product (p_j^k_j) then a(n) = Product (p_j * k_j).at n=58A000026
- The positive integers. Also called the natural numbers, the whole numbers or the counting numbers, but these terms are ambiguous.at n=58A000027
- Let k = p_1^e_1 p_2^e_2 p_3^e_3 ... be the prime factorization of n. Sequence gives k such that the sum of the numbers of 1's in the binary expansions of e_1, e_2, e_3, ... is odd.at n=27A000028
- Numbers that are not squares (or, the nonsquares).at n=51A000037
- 1-digit numbers arranged in alphabetical order, then the 2-digit numbers arranged in alphabetical order, then the 3-digit numbers, etc.at n=27A000052
- Local stops on New York City 1 Train (Broadway-7 Avenue Local) subway.at n=7A000053
- Local stops on New York City A line subway.at n=6A000054
- Numbers k such that (2k)^4 + 1 is prime.at n=18A000059
- A Beatty sequence: a(n) = floor(n/(e-2)).at n=42A000062
- Odious numbers: numbers with an odd number of 1's in their binary expansion.at n=29A000069
- a(n) = number of compositions of n in which the maximum part size is 4.at n=9A000102
- Positive zeros of Bessel function of order 0 rounded to nearest integer.at n=18A000134
- Lower Wythoff sequence (a Beatty sequence): a(n) = floor(n*phi), where phi = (1+sqrt(5))/2 = A001622.at n=36A000201
- 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=9A000232