258
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 528
- Proper Divisor Sum (Aliquot Sum)
- 270
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 84
- Möbius Function
- -1
- Radical
- 258
- 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
- 122
- 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
- zweihundertachtundfünfzig· ordinal: zweihundertachtundfünfzigste
- English
- two hundred fifty-eight· ordinal: two hundred fifty-eighth
- Spanish
- doscientos cincuenta y ocho· ordinal: 258º
- French
- deux cent cinquante-huit· ordinal: deux cent cinquante-huitième
- Italian
- duecentocinquantotto· ordinal: 258º
- Latin
- ducenti quinquaginta octo· ordinal: 258.
- Portuguese
- duzentos e cinquenta e oito· ordinal: 258º
Appears in sequences
- Number of positive integers <= 2^n of form 2*x^2 + 3*y^2.at n=10A000075
- Convolution of A000203 with itself.at n=7A000385
- Number of fixed-point-free permutation groups of degree n.at n=9A000637
- Boustrophedon transform of Bell numbers.at n=5A000764
- Numbers that are not the sum of 4 tetrahedral numbers.at n=17A000797
- Numbers that are divisible by at least three different primes.at n=44A000977
- Numbers that are the sum of 2 successive primes.at n=30A001043
- a(n) = floor(n*log((14/11)*n^(10/9))).at n=54A001195
- Erroneous version of A000637.at n=9A001493
- Nearest integer to 2*n*log(n).at n=36A001618
- Number of partitions with no even part repeated; partitions of n in which no parts are multiples of 4.at n=19A001935
- Number of partitions of n into nonprime parts.at n=30A002095
- a(0) = 1, a(1) = 0, a(2) = -1; for n >= 3, a(n) = - a(n-2) + Sum_{ primes p with 3 <= p <= n} a(n-p).at n=35A002121
- Smallest number of stones in Tchoukaillon (or Mancala, or Kalahari) solitaire that make use of n-th hole.at n=27A002491
- Numbers k such that (k^2 + k + 1)/19 is prime.at n=12A002643
- Terms in certain determinants.at n=3A002776
- Ulam numbers: a(1) = 1; a(2) = 2; for n>2, a(n) = least number > a(n-1) which is a unique sum of two distinct earlier terms.at n=50A002858
- a(1) = 1, a(2) = 3; for n >= 3, a(n) is smallest number that is uniquely of the form a(j) + a(k) with 1 <= j < k < n.at n=59A002859
- a(n) (n>6) is least integer > a(n-1) with precisely three representations a(n) = a(i) + a(j), 1 <= i < j < n, a(n) = n for n=1..6.at n=52A003045
- Numbers that are the sum of 3 positive cubes.at n=35A003072