1383
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 1848
- Proper Divisor Sum (Aliquot Sum)
- 465
- 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
- 920
- Möbius Function
- 1
- Radical
- 1383
- 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
- 96
- 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
- One half of the number of permutations of [n] such that the differences have three runs with the same signs.at n=4A000352
- a(n) is the solution to the postage stamp problem with 4 denominations and n stamps.at n=14A001209
- Numbers k such that 2*25^k - 1 is prime.at n=10A002958
- Losing initial positions in game: two players alternate in removing >= 1 stones; last player wins; first player may not remove all stones; each move <= 3 times previous move.at n=21A003411
- Numbers k such that k*4^k + 1 is prime.at n=8A007646
- Coordination sequence T2 for Zeolite Code LTL.at n=27A008139
- Coordination sequence T6 for Zeolite Code MEL.at n=24A008155
- Coordination sequence T1 for Zeolite Code MOR.at n=24A008182
- Triangle T(n,k) = P(n,k)/2, n >= 2, 1 <= k < n, of one-half of number of permutations of 1..n such that the differences have k runs with the same signs.at n=23A008970
- Expansion of e.g.f. cos(x)/exp(sinh(x)).at n=9A009113
- Coordination sequence T2 for Zeolite Code VNI.at n=23A009908
- Sum along upward diagonal of Pascal triangle from (but not including) halfway point.at n=17A010758
- From table of maximal epacts e(p) and corresponding primes p, for x_1=2, x_{m+1} = (x_m)^2+1; sequence gives e(p).at n=41A014423
- Expansion of 1/(1-x^6-x^7-x^8-x^9-x^10-x^11-x^12).at n=41A017852
- n-th composite is sum of first k composites for some k.at n=37A020642
- Expansion of (1+x^10)/((1-x)*(1-x^2)*(1-x^3)*(1-x^5)).at n=49A020702
- a(n) = L(n+1) + c(n) where L(k) = k-th Lucas number and c(n) is n-th number that is 1 or not a Lucas number.at n=13A022802
- a(n) = b(n) + d(n), where b(n) = (n-th Lucas number > 3) and d(n) = (n-th non-Fibonacci number).at n=12A023487
- a(n) = b(n) + d(n), where b(n) = (n-th Lucas number > 3) and d(n) = (n-th non-Lucas number).at n=12A023495
- a(n) = s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n+1-k), where k = [ (n+1)/2 ], s = (1, p(1), p(2), ...).at n=14A024479