1436
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 2520
- Proper Divisor Sum (Aliquot Sum)
- 1084
- 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
- 716
- Möbius Function
- 0
- Radical
- 718
- Omega Function (Ω)
- 3
- 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
- 52
- 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 partitions into non-integral powers.at n=8A000298
- a(n) = A002527(n+1) - A002527(n) - A002526(n).at n=8A002529
- Critical connected topologies with n points.at n=7A003097
- From a counter moving problem.at n=13A004138
- Discriminants of totally real cubic fields.at n=41A006832
- Coordination sequence T2 for Zeolite Code DDR.at n=24A008072
- Coordination sequence T1 for Zeolite Code LOV.at n=25A008134
- Expansion of g.f.: x^4/((1-x)*(1-x^2)^2*(1-x^3)).at n=47A008763
- If a, b in sequence, so is ab+4.at n=28A009303
- Coordination sequence T1 for Zeolite Code RUT.at n=25A009897
- Numbers k such that C(k,3) = C(x,3) + C(y,3) is solvable.at n=38A010330
- a(n) = floor( n*(n-1)*(n-2)/25 ).at n=34A011907
- Numbers k such that phi(k) + 10 | sigma(k + 10).at n=36A015789
- Number of lines through exactly 7 points of an n X n grid of points.at n=34A018814
- Number of lines through exactly 10 points of an n X n grid of points.at n=53A018817
- Cycle class sequence c(n) (the number of true cycles of length n in which a certain node is included) for zeolite CON = CIT-1 H2[B2Si54O112] starting with a T2 atom.at n=10A019095
- Cycle class sequence c(n) (the number of true cycles of length n in which a certain node is included) for zeolite DDR = Deca-dodecasil 3R[Si120O240]qR starting with a T3 atom.at n=10A019111
- 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 T1 atom.at n=10A019199
- Ceiling of Gamma(n+2/11)/Gamma(2/11).at n=8A020103
- Positive numbers k such that k and 4*k are anagrams in base 7 (written in base 7).at n=4A023070