230
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 5
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 432
- Proper Divisor Sum (Aliquot Sum)
- 202
- 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
- 88
- Möbius Function
- -1
- Radical
- 230
- 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
- yes
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 34
- 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
- zweihundertdreißig· ordinal: zweihundertdreißigste
- English
- two hundred thirty· ordinal: two hundred thirtieth
- Spanish
- doscientos treinta· ordinal: 230º
- French
- deux cent trente· ordinal: deux cent trentième
- Italian
- duecentotrenta· ordinal: 230º
- Latin
- ducenti triginta· ordinal: 230.
- Portuguese
- duzentos e trinta· ordinal: 230º
Appears in sequences
- Number of ways of making change for n cents using coins of 1, 2, 5, 10 cents.at n=43A000008
- -1 + number of partitions of n.at n=16A000065
- Let A(n) = #{(i,j,k): i^2 + j^2 + k^2 <= n}, V(n) = (4/3)Pi*n^(3/2), P(n) = A(n) - V(n); sequence gives values of n where |P(n)| sets a new record.at n=13A000092
- a(n) = n*(n+3)/2.at n=20A000096
- 5th power of rooted tree enumerator; number of linear forests of 5 rooted trees.at n=4A000343
- Powers of rooted tree enumerator.at n=4A000439
- Number of steps to reach 1 in sequence A000546.at n=36A000547
- Number of nonnegative solutions to x^2 + y^2 + z^2 <= n.at n=48A000606
- Genus of complete graph on n nodes.at n=55A000933
- Numbers that are divisible by at least three different primes.at n=36A000977
- Triangle read by rows: T(n,k) = number of permutations of length n with exactly k rising or falling successions, for n >= 1, 0 <= k <= n-1.at n=16A001100
- Number of ways of making change for n cents using coins of 1, 2, 5, 10, 25 cents.at n=41A001301
- Number of ways of making change for n cents using coins of 1, 2, 5, 10, 25, 50 cents.at n=41A001302
- Number of ways of making change for n cents using coins of 1, 2, 5, 10, 50, 100 cents.at n=43A001312
- Number of n-stacks with strictly receding walls, or the number of Type A partitions of n in the sense of Auluck (1951).at n=19A001522
- Tribonacci numbers: a(n) = a(n-1) + a(n-2) + a(n-3) with a(0)=0, a(1)=1, a(2)=0.at n=12A001590
- Expansion of 1/((1+x)*(1-x)^11).at n=3A001786
- a(1)=2, 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=46A001857
- a(n) = floor((n+2/3)*(5+sqrt(13))/2); v-pile positions in the 3-Wythoff game.at n=53A001960
- A Beatty sequence: floor(n * (sqrt(5) + 3)).at n=43A001962