6157
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 6336
- Proper Divisor Sum (Aliquot Sum)
- 179
- 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
- 5980
- Möbius Function
- 1
- Radical
- 6157
- Omega Function (Ω)
- 2
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 36
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- Pisot sequence E(6,16), a(n) = floor( a(n-1)^2/a(n-2) + 1/2 ).at n=7A010915
- (d(n)-r(n))/5, where d = A026046 and r is the periodic sequence with fundamental period (1,0,4,0,0).at n=41A026048
- Number of partitions of n with equal number of parts congruent to each of 0 and 4 (mod 5).at n=37A035555
- Smallest semiprime p*q such that q >= p and q mod p = n.at n=37A064910
- Product L(n)*S(n), where L(n) are Lucas numbers and S(n) are Lucas 3-step numbers = A000032(n) * A001644(n).at n=8A073446
- Trajectory of n under the Reverse and Add! operation carried out in base 4 (presumably) does not reach a palindrome and (presumably) does not join the trajectory of any term m < n.at n=24A075421
- a(n) = 4*n^2 + 10*n + 1.at n=38A082112
- a(1) = 7 then the smallest number such that the forward as well as the reverse n-th partial concatenation is a prime for n>1. (Reverse concatenation is taken term-wise and not digit-wise).at n=31A083994
- a(n) = smallest k such that the base 4 Reverse and Add! trajectory of A075421(n) joins the trajectory of k.at n=24A091676
- Fundamental discriminants of real quadratic number fields with class number 5.at n=28A094614
- Triangle read by rows: T(n,k) is the number of Motzkin paths of length n and having k peaks at odd height.at n=42A097891
- a(n) = n^3 + n^2 + 1.at n=18A098547
- Numbers k such that 13k = 6j^2 + 6j + 1.at n=17A106390
- a(n) = 8*n^2 - 4*n - 3.at n=27A118057
- Decomposition of function F = x/(1-x) into functions of the form [x + a(n)*x^n]: x = ...o x+a(n)*x^n o...o x+a(3)*x^3 o x+a(2)*x^2 o a(1)*x o F.at n=12A119459
- Number of 1-sided polycairos with n cells.at n=7A151534
- a(n) = n*(n-th prime) + (n+1)*((n+1)-th prime).at n=27A152117
- a(n) = 162*n + 1.at n=37A157952
- a(n) = 324*n + 1.at n=18A158272
- a(n) = 76*n^2 + 1.at n=9A158767