1424
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
- 2
Divisibility
- Divisor Count
- 10
- Divisor Sum
- 2790
- Proper Divisor Sum (Aliquot Sum)
- 1366
- 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
- 704
- Möbius Function
- 0
- Radical
- 178
- Omega Function (Ω)
- 5
- 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
- 34
- 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
- Series-parallel numbers.at n=3A000432
- Number of nonnegative solutions to x^2 + y^2 <= n^2.at n=42A000603
- Number of one-sided triangulations of the disk; or flexagons of order n; or unlabeled plane trivalent trees (n-2 internal vertices, all of degree 3 and hence n leaves).at n=10A001683
- a(n) = Sum_{k=0..n} f(k)*f(n-k) where f(k) = A002124(k).at n=27A002125
- Absolute value of Glaisher's beta'(2n+1).at n=34A002291
- Coefficients of Bell's formula for making change.at n=3A002576
- Dowling numbers: e.g.f. exp(x + (exp(b*x)-1)/b) with b=8.at n=4A003580
- Primes written in base 5.at n=51A004679
- a(n)=least number m such that m-a(n-1)<>a(j)-a(k) for all j,k less than m; a(1)=1, a(2)=3.at n=36A004979
- Coordination sequence T1 for Zeolite Code APD.at n=25A008034
- Coordination sequence T1 for Zeolite Code EPI.at n=24A008090
- Pisot sequence E(4,13): a(n) = floor( a(n-1)^2/a(n-2) + 1/2 ).at n=5A010900
- a(n) = floor( n*(n-1)*(n-2)*(n-3)/23 ).at n=15A011933
- Positive integers n such that 2^n == 2^5 (mod n).at n=48A015925
- Squares on infinite chessboard at n moves from center using a {2,3} fairy knight.at n=22A018839
- Cycle class sequence c(2n) (the number of true cycles of length 2n in which a certain node is included) for zeolite PAR = Partheite Ca8[Al16Si16O60(OH)8].16H2O starting with a T1 atom.at n=5A019045
- Cycle class sequence c(n) (the number of true cycles of length n in which a certain node is included) for zeolite MTW = ZSM-12 Nan[AlnSi28-nO56] starting with a T2 atom.at n=10A019198
- Fibonacci sequence beginning 0, 16.at n=11A022350
- a(n) = a(n-1) + c(n) for n >= 3, a( ) increasing, given a(1)=1 a(2)=6; where c( ) is complement of a( ).at n=47A022949
- a(n) = a(n-1) + c(n) for n >= 3, a( ) increasing, given a(1)=3 a(2)=6; where c( ) is complement of a( ).at n=47A022952