1164
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 2744
- Proper Divisor Sum (Aliquot Sum)
- 1580
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 384
- Möbius Function
- 0
- Radical
- 582
- Omega Function (Ω)
- 4
- 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
- 119
- 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
- yes
- Odd
- no
Appears in sequences
- Number of permutations of order n with the length of longest run equal to 4.at n=6A001252
- a(1) = 0, a(2) = 0; for n > 2, a(n) - a(n-3) - a(n-5) - ... - a(n-p) = n if n is prime, otherwise = 0, where p = largest prime < n.at n=26A002123
- Numbers that are the sum of 10 positive 5th powers.at n=49A003355
- Maximal sum of inverse squares of the singular values of triangular anti-Hadamard matrices of order n.at n=8A005313
- Conway-Guy sequence: a(n + 1) = 2a(n) - a(n - floor( 1/2 + sqrt(2n) )).at n=12A005318
- Deficit in peeling rinds.at n=7A005675
- Number of aperiodic binary necklaces of length n with no subsequence 00, excluding the necklace "0".at n=20A006206
- Sum of squared spans of 2n-step polygons on square lattice.at n=5A006773
- Coordination sequence T7 for Zeolite Code DDR.at n=21A008077
- Coordination sequence T3 for Zeolite Code -CHI.at n=22A009848
- Coordination sequence T5 for Zeolite Code VET.at n=21A009906
- Coordination sequence T3 for Zeolite Code VNI.at n=21A009909
- Triangle read by rows: number of permutations of 1..n by length of longest run.at n=18A010026
- phi(n) + 8 | sigma(n).at n=42A015799
- Initial pile sizes which guarantee a win for player 2 in a certain variant of Nim.at n=29A016741
- Expansion of 1/(1-x^6-x^7-x^8-x^9-x^10).at n=44A017850
- Numbers whose sum of divisors is a cube.at n=16A020477
- Convolution of Fibonacci numbers and {F(2), F(3), F(4), ...}.at n=10A023610
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = A023532, t = A000201 (lower Wythoff sequence).at n=48A024373
- a(n) = s(1)*s(2)*...*s(n+1)*(1/s(2) - 1/s(3) + ... + c/s(n+1)), where c = (-1)^(n+1) and s(k) = 3k-1 for k = 1,2,3,...at n=3A024397