1334
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 2160
- Proper Divisor Sum (Aliquot Sum)
- 826
- 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
- 616
- Möbius Function
- -1
- Radical
- 1334
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 145
- 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
- Numbers k such that k and k+1 have same sum of divisors.at n=3A002961
- Number of (undirected) Hamiltonian paths in the n-ladder graph K_2 X P_n.at n=36A003682
- Numbers k such that k, k+1 and k+2 have the same number of divisors.at n=26A005238
- a(n) = n*(5*n+1)/2.at n=23A005475
- Cald's sequence: a(n+1) = a(n) - prime(n) if that value is positive and new, otherwise a(n) + prime(n) if new, otherwise 0; start with a(1)=1.at n=128A006509
- Oscillates under partition transform.at n=30A007211
- Coordination sequence T3 for Zeolite Code AFO.at n=24A008017
- Coordination sequence T4 for Zeolite Code AFO.at n=24A008018
- Coordination sequence T2 for Zeolite Code AWW.at n=26A008046
- Coordination sequence T1 for Zeolite Code BOG.at n=26A008049
- Coordination sequence T1 for Zeolite Code CHA.at n=28A008066
- Coordination sequence T5 for Zeolite Code RUT.at n=24A009901
- Coordination sequence for Ni2In, Position Ni2.at n=11A009942
- a(n) = floor(binomial(n,6)/6).at n=16A011852
- a(n) = floor(n(n-1)(n-2)(n-3)/18).at n=14A011928
- a(n) = n^2 + n + 2.at n=36A014206
- Form a permutation of the positive integers, p_1, p_2, ..., such that the average of each initial segment is an integer, using the greedy algorithm to define p_n; sequence gives p_1 + ... + p_n.at n=45A019445
- Numbers k such that the continued fraction for sqrt(k) has period 22.at n=26A020361
- Numbers k such that Fibonacci(k) == -55 (mod k).at n=30A023170
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (Lucas numbers), t = (F(2), F(3), ...).at n=10A024472