6137
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 6858
- Proper Divisor Sum (Aliquot Sum)
- 721
- 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
- 5472
- Möbius Function
- 0
- Radical
- 323
- Omega Function (Ω)
- 3
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 124
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- no
- Odd
- yes
Appears in sequences
- Centered dodecahedral numbers.at n=8A005904
- a(n) = n + (n+1)^2 + (n+2)^3.at n=16A027620
- Products p^3 or p^2*q, where {p,q} are consecutive primes.at n=20A033477
- Number of partitions of n such that cn(3,5) <= cn(0,5) = cn(1,5) <= cn(2,5) = cn(4,5).at n=66A036865
- a(n) = a(1) + a(2) + ... + a(n-1) - a(m) for n >= 3, where m = 2*n - 2 - 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) = 3.at n=16A049919
- 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=35A050028
- 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=35A050044
- 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=35A050060
- Consider all integer triples (i,j,k), j,k>0, with binomial(i+2,3)=binomial(j+2,3)+k^3, ordered by increasing i; sequence gives k values.at n=37A054223
- Increasing sequence with no repeating digits and no digits shared with previous term.at n=27A054659
- Increasing values of the Improperly Reduced Fibonacci Sequence (A058981).at n=35A058982
- Numbers n such that sum of digits of n equals the squarefree part of n.at n=41A070274
- Numbers k such that (k / sum of digits of k) and (k+1 / sum of digits of k+1) are both semiprime.at n=13A085774
- 47-gonal numbers.at n=16A095311
- Unsigned member r=-17 of the family of Chebyshev sequences S_r(n) defined in A092184.at n=4A099275
- a(n) = (2*n-1)*(2*n+1)^2.at n=8A102094
- Number of hierarchical orderings for n unlabeled elements with 2 possible classes for levels l>=2.at n=7A104460
- a(1) = 2; a(n+1) = a(n) + p, where p is the largest prime <= a(n).at n=12A123196
- a(3n) = n, a(3n+1) = (n+2)*a(3n), a(3n+2) = (n+2)*a(3n+1).at n=53A125301
- Numbers k such that 3*k+2, 4*k+3 and 5*k+4 are primes.at n=38A126956