58
domain: N
Properties
Digital Properties
- Digit Count
- 2
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 90
- Proper Divisor Sum (Aliquot Sum)
- 32
- 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
- 28
- Möbius Function
- 1
- Radical
- 58
- 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
- 19
- Smith Number
- yes
Classification
- Natural
- yes
- Even
- yes
- Odd
- 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
Names
- German
- achtundfünfzig· ordinal: achtundfünfzigste
- English
- fifty-eight· ordinal: fifty-eighth
- Spanish
- cincuenta y ocho· ordinal: 58º
- French
- cinquante-huit· ordinal: cinquante-huitième
- Italian
- cinquantotto· ordinal: 58º
- Latin
- quinquaginta octo· ordinal: 58.
- Portuguese
- cinquenta e oito· ordinal: 58º
Appears in sequences
- Number of ways of making change for n cents using coins of 1, 2, 5, 10 cents.at n=24A000008
- Euler totient function phi(n): count numbers <= n and prime to n.at n=58A000010
- Coefficients of the 3rd-order mock theta function f(q).at n=25A000025
- Mosaic numbers or multiplicative projection of n: if n = Product (p_j^k_j) then a(n) = Product (p_j * k_j).at n=57A000026
- The positive integers. Also called the natural numbers, the whole numbers or the counting numbers, but these terms are ambiguous.at n=57A000027
- Numbers that are not squares (or, the nonsquares).at n=50A000037
- 1-digit numbers arranged in alphabetical order, then the 2-digit numbers arranged in alphabetical order, then the 3-digit numbers, etc.at n=24A000052
- A Beatty sequence: a(n) = floor(n/(e-2)).at n=41A000062
- Smallest number of vertices in trivalent graph with girth (shortest cycle) = n.at n=6A000066
- a(n) = floor(n^(3/2)).at n=15A000093
- Denumerants: Expansion of 1/((1-x)*(1-x^2)*(1-x^5)).at n=30A000115
- A nonlinear binomial sum.at n=6A000128
- Series-parallel numbers.at n=4A000137
- Number of trees of diameter 5.at n=10A000147
- Coefficient of q^(2n-1) in the series expansion of Ramanujan's mock theta function f(q).at n=12A000199
- Lower Wythoff sequence (a Beatty sequence): a(n) = floor(n*phi), where phi = (1+sqrt(5))/2 = A001622.at n=35A000201
- a(8i+j) = 13i + a(j), where 1<=j<=8.at n=35A000202
- A Beatty sequence: floor(n*(e-1)).at n=33A000210
- Take sum of squares of digits of previous term, starting with 2.at n=4A000216
- Take sum of squares of digits of previous term, starting with 2.at n=12A000216