130
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 4
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 252
- Proper Divisor Sum (Aliquot Sum)
- 122
- 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
- 48
- Möbius Function
- -1
- Radical
- 130
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 28
- 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
- einshundertdreißig· ordinal: einshundertdreißigste
- English
- one hundred thirty· ordinal: one hundred thirtieth
- Spanish
- ciento treinta· ordinal: 130º
- French
- cent trente· ordinal: cent trentième
- Italian
- centotrenta· ordinal: 130º
- Latin
- centum triginta· ordinal: 130.
- Portuguese
- cento e trinta· ordinal: 130º
Appears in sequences
- Number of ways of making change for n cents using coins of 1, 2, 5, 10 cents.at n=34A000008
- 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=61A000028
- Generalized tangent numbers d(n,1).at n=49A000061
- Let A(n) = #{(i,j): i^2 + j^2 <= n}, V(n) = Pi*n, P(n) = A(n) - V(n); sequence gives values of n where |P(n)| sets a new record.at n=9A000099
- Number of n-node triangulations of sphere in which every node has degree >= 4.at n=8A000103
- Denumerants: Expansion of 1/((1-x)*(1-x^2)*(1-x^5)).at n=47A000115
- Cake numbers: maximal number of pieces resulting from n planar cuts through a cube (or cake): C(n+1,3) + n + 1.at n=9A000125
- Associated Stirling numbers.at n=2A000276
- 3*n - 2*floor(sqrt(4*n+5)) + 5.at n=51A000277
- Topswops (2): start by shuffling n cards labeled 1..n. If the top card is m, reverse the order of the top m cards. Repeat until 1 gets to the top, then stop. Suppose the whole deck is now sorted (if not, discard this case). a(n) is the maximal number of steps before 1 got to the top.at n=15A000376
- Numbers that are the sum of 2 nonzero squares.at n=45A000404
- Numbers that are the sum of 2 but no fewer nonzero squares.at n=43A000415
- n written in base where place values are positive cubes.at n=51A000433
- 1 together with products of 2 or more distinct primes.at n=48A000469
- Numbers that are the sum of 2 squares but not sum of 3 nonzero squares.at n=20A000549
- A Beatty sequence: [ n(e+1) ].at n=34A000572
- Expansion of Product_{k >= 1} (1 - x^k)^6.at n=24A000729
- Number of numbers == 0 (mod 3) in range 2^n to 2^(n+1) with odd number of 1's in binary expansion.at n=9A000773
- Total number of 1's in binary expansions of 0, ..., n.at n=48A000788
- Numbers beginning with a vowel in English.at n=44A000852