6130
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 11052
- Proper Divisor Sum (Aliquot Sum)
- 4922
- 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
- 2448
- Möbius Function
- -1
- Radical
- 6130
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 155
- Smith Number
- no
- Vampire 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
Appears in sequences
- Powers of fifth root of 13 rounded up.at n=17A018152
- Numbers k such that the continued fraction for sqrt(k) has period 23.at n=22A020362
- (d(n)-r(n))/2, where d = A008778 and r is the periodic sequence with fundamental period (1,1,0,1).at n=38A026052
- Number of partitions of n into parts not of the form 21k, 21k+5 or 21k-5. Also number of partitions with at most 4 parts of size 1 and differences between parts at distance 9 are greater than 1.at n=32A035983
- Numbers that are divisible by 5 and are the difference between two (different positive) cubes in at least one way.at n=28A038853
- Numbers that are divisible by 10 and are differences between two cubes in at least one way.at n=8A038854
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = a(2) = 1 and a(3) = 2.at n=33A050028
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1 and a(2) = a(3) = 2.at n=33A050044
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 3, and a(3) = 2.at n=33A050060
- Numbers k such that 3*2^k - 5 is prime.at n=33A057912
- Sum of products of parts increased by 1 in hook partitions of n, where hook partitions are of the form h*1^(n-h).at n=11A077802
- Increasing gaps in A038593 (upper terms).at n=10A093362
- a(n+3) = 3*a(n+2) - 2*a(n+1) + 1 with a(0)=0, a(1)=2.at n=11A095151
- Structured disdyakis dodecahedral numbers (vertex structure 7).at n=9A100162
- Matrix logarithm of triangle A107719, read by rows.at n=31A107724
- a(n) is the optimal wire-length for an n X n grid.at n=18A195647
- Number of 10's in the last section of the set of partitions of n.at n=48A206560
- 20k^2-40k+10 interleaved with 20k^2-20k+10 for k>=0.at n=37A216875
- Round(-1/n + 1/log((2n+1)/(2n-1))).at n=7A227513
- Number of arrays of the median of three adjacent elements of some length -(n+2) 0..3 array.at n=6A228735